Sciweavers

1772 search results - page 92 / 355
» Classifying Problems into Complexity Classes
Sort
View
CSL
2007
Springer
15 years 8 months ago
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
Yijia Chen, Jörg Flum
CVPR
2007
IEEE
16 years 4 months ago
Fast Keypoint Recognition in Ten Lines of Code
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Pascal Fua, Vincent Lepetit
123
Voted
ICPR
2004
IEEE
16 years 3 months ago
Probabilistic Combination of Multiple Modalities to Detect Interest
This paper describes a new approach to combine multiple modalities and applies it to the problem of affect recognition. The problem is posed as a combination of classifiers in a p...
Ashish Kapoor, Rosalind W. Picard, Yuri Ivanov
107
Voted
MCS
2004
Springer
15 years 8 months ago
Learn++.MT: A New Approach to Incremental Learning
An ensemble of classifiers based algorithm, Learn++, was recently introduced that is capable of incrementally learning new information from datasets that consecutively become avail...
Michael Muhlbaier, Apostolos Topalis, Robi Polikar
141
Voted
FOCS
2007
IEEE
15 years 9 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis