Viggo Kann - Profile on Academia.edu (original) (raw)
Papers by Viggo Kann
Using reflections in a program integrating course
Proceedings of the 2014 conference on Innovation & technology in computer science education - ITiCSE '14, 2014
On the approximation of minimizing non zero variables or unsat-is�ed relations in linear systems
Evaluation of word space models is usually local in the sense that it only considers words that a... more Evaluation of word space models is usually local in the sense that it only considers words that are deemed very similar by the model. We propose a global evaluation scheme based on clustering of the words. A clustering of high quality in an external evaluation against a semantic resource, such as a dictionary of synonyms, indicates a word space model of high quality. We use Random Indexing to create several different models and compare them by clustering evaluation against the People's Dictionary of Synonyms, a list of Swedish synonyms that are graded by the public. Most notably we get better results for models based on syntagmatic information (words that appear together) than for models based on paradigmatic information (words that appear in similar contexts). This is quite contrary to previous results that have been presented for local evaluation. Clusterings to ten clusters result in a recall of 83% for a syntagmatic model, compared to 34% for a comparable paradigmatic model, and 10% for a random partition.
Complexity and approarirnation; combinatorial optimization problems and their approxirnability properties
On the approximation of minimizing non zero variables or unsat-isˉed relations in linear systems
On the hardness of max k-cut and its dual
Israel Symposium on Theory of Computing Systems, 1996
Text as a Linguistic Paradigm: Levels
From theory to practice
Proceedings of the 18th ACM conference on Innovation and technology in computer science education - ITiCSE '13, 2013
The approximability of satisfying subsystems of linear systems
Slutrapport för projektet Vidareutveckling av Folkets lexikon
Slutrapport för projektet Vidareutveckling av Folkets lexikon med fokus på tillgänglighet
Iteratively interventing with the" most difficult" topics of an algorithms and complexity course
Approximation through Randomization
Complexity and Approximation, 1999
The PCP theorem
Complexity and Approximation, 1999
NP, PCP and Non-approximability Results
Complexity and Approximation, 1999
Approximation Preserving Reductions
Complexity and Approximation, 1999
Input-Dependent and Asymptotic Approximation
Complexity and Approximation, 1999
Design Techniques for Approximation Algorithms
Complexity and Approximation, 1999
Using reflections in a program integrating course
Proceedings of the 2014 conference on Innovation & technology in computer science education - ITiCSE '14, 2014
On the approximation of minimizing non zero variables or unsat-is�ed relations in linear systems
Evaluation of word space models is usually local in the sense that it only considers words that a... more Evaluation of word space models is usually local in the sense that it only considers words that are deemed very similar by the model. We propose a global evaluation scheme based on clustering of the words. A clustering of high quality in an external evaluation against a semantic resource, such as a dictionary of synonyms, indicates a word space model of high quality. We use Random Indexing to create several different models and compare them by clustering evaluation against the People's Dictionary of Synonyms, a list of Swedish synonyms that are graded by the public. Most notably we get better results for models based on syntagmatic information (words that appear together) than for models based on paradigmatic information (words that appear in similar contexts). This is quite contrary to previous results that have been presented for local evaluation. Clusterings to ten clusters result in a recall of 83% for a syntagmatic model, compared to 34% for a comparable paradigmatic model, and 10% for a random partition.
Complexity and approarirnation; combinatorial optimization problems and their approxirnability properties
On the approximation of minimizing non zero variables or unsat-isˉed relations in linear systems
On the hardness of max k-cut and its dual
Israel Symposium on Theory of Computing Systems, 1996
Text as a Linguistic Paradigm: Levels
From theory to practice
Proceedings of the 18th ACM conference on Innovation and technology in computer science education - ITiCSE '13, 2013
The approximability of satisfying subsystems of linear systems
Slutrapport för projektet Vidareutveckling av Folkets lexikon
Slutrapport för projektet Vidareutveckling av Folkets lexikon med fokus på tillgänglighet
Iteratively interventing with the" most difficult" topics of an algorithms and complexity course
Approximation through Randomization
Complexity and Approximation, 1999
The PCP theorem
Complexity and Approximation, 1999
NP, PCP and Non-approximability Results
Complexity and Approximation, 1999
Approximation Preserving Reductions
Complexity and Approximation, 1999
Input-Dependent and Asymptotic Approximation
Complexity and Approximation, 1999
Design Techniques for Approximation Algorithms
Complexity and Approximation, 1999
25 oktober 2017, prodekanus seminarieserie, KTH