Sciweavers

1651 search results - page 192 / 331
» Measuring the Complexity of Classification Problems
Sort
View
WSCG
2004
139views more  WSCG 2004»
13 years 9 months ago
Methods for Indexing Stripes in Uncoded Structured Light Scanning Systems
This paper presents robust methods for determining the order of a sequence of stripes captured in an uncoded structured light scanning system, i.e. where all the stripes are proje...
Alan Robinson, Lyuba Alboul, Marcos A. Rodrigues
TIP
2008
108views more  TIP 2008»
13 years 8 months ago
Design of Linear Equalizers Optimized for the Structural Similarity Index
Abstract--We propose an algorithm for designing linear equalizers that maximize the structural similarity (SSIM) index between the reference and restored signals. The SSIM index ha...
Sumohana S. Channappayya, Alan C. Bovik, Constanti...
LCC
1994
248views Algorithms» more  LCC 1994»
14 years 7 days ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
KDD
2004
ACM
163views Data Mining» more  KDD 2004»
14 years 8 months ago
Exploiting dictionaries in named entity extraction: combining semi-Markov extraction processes and data integration methods
We consider the problem of improving named entity recognition (NER) systems by using external dictionaries--more specifically, the problem of extending state-of-the-art NER system...
William W. Cohen, Sunita Sarawagi
JCSS
2008
138views more  JCSS 2008»
13 years 8 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...