Searching for authors named "Viggo Kann" – sorted by Relevance.
22 documents found, showing 1 through 10.
Next 10 →
-
an on-line
- … Viggo Kann KTH CSC viggo@(email omitted); Tvärslå is a dynamically expandable multilingual on-line dictionary…
- Add To MetaCart
-
Strong lower bounds on the approximability of some NPO PB-complete maximization problems
- …Strong lower bounds on the approximability of some NPO PB-complete maximization problems Viggo…
- Cited by 8 (2 self) – Add To MetaCart
-
Polynomially Bounded Minimization Problems That Are Hard To Approximate
- … Viggo Kann Department of Numerical Analysis and Computing Science Royal Institute of Technology S-100…
- Cited by 17 (5 self) – Add To MetaCart
-
On the Approximability of Removing the Smallest Number of Relations from Linear Systems to Achieve Feasibility
- … amaldi@(email omitted); Viggo Kann Department of Numerical Analysis and Computing Science Royal Institute…
- Cited by 6 (4 self) – Add To MetaCart
-
Implementing an Efficient Part-of-Speech Tagger
- …Implementing an efficient part-of-speech tagger # Johan Carlberger Viggo Kann jfc…
- Cited by 19 (4 self) – Add To MetaCart
-
Some applications of a statistical tagger for Swedish
- …Some applications of a statistical tagger for Swedish Johan Carlberger Viggo Kann Keywords…
- Cited by 5 (0 self) – Add To MetaCart
-
On the Approximability of Some NP-hard Minimization Problems for Linear Systems
- … Ithaca, NY 14853 amaldi@(email omitted); Viggo Kann Department of Numerical Analysis and Computing…
- Cited by 4 (0 self) – Add To MetaCart
-
How to find the best approximation results -- a followup to Garey and Johnson
- … Crescenzi# Viggo Kann## Abstract A compendium of NP optimization problems, containing the best…
- Cited by 2 (0 self) – Add To MetaCart
-
Finding the correct interpretation of Swedish compounds, a statistical approach
- …, Viggo Kann KTH Nada SE-100 44 Stockholm, Sweden {jsh, viggo}@(email omitted); Abstract This paper treats…
- Cited by 5 (0 self) – Add To MetaCart
-
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations
- …@(email omitted); Viggo Kann Department of Numerical Analysis and Computing Science Royal Institute of Technology S-100 44…
- Cited by 64 (11 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
