Sciweavers

1772 search results - page 102 / 355
» Classifying Problems into Complexity Classes
Sort
View
136
Voted
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
15 years 6 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt
134
Voted
ASC
2008
15 years 2 months ago
Development of scheduling strategies with Genetic Fuzzy systems
This paper presents a methodology for automatically generating online scheduling strategies for a complex objective defined by a machine provider. To this end, we assume independe...
Carsten Franke, Frank Hoffmann, Joachim Lepping, U...
133
Voted
CVPR
2006
IEEE
16 years 4 months ago
SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...
Alexander C. Berg, Hao Zhang 0003, Jitendra Malik,...
96
Voted
ECOOP
2007
Springer
15 years 8 months ago
Matching Objects with Patterns
Data in object-oriented programming is organized in a hierarchy of classes. The problem of object-oriented pattern matching is how to explore this hierarchy from the outside. This ...
Burak Emir, Martin Odersky, John Williams
130
Voted
BICOB
2010
Springer
15 years 20 days ago
Multiple Kernel Learning for Fold Recognition
Fold recognition is a key problem in computational biology that involves classifying protein sharing structural similarities into classes commonly known as "folds". Rece...
Huzefa Rangwala