Sciweavers

1772 search results - page 44 / 355
» Classifying Problems into Complexity Classes
Sort
View
COCO
1989
Springer
110views Algorithms» more  COCO 1989»
13 years 11 months ago
The Complexity of Iterated Multiplication
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
Neil Immerman, Susan Landau
CIE
2009
Springer
14 years 2 months ago
Complexity of Existential Positive First-Order Logic
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
Manuel Bodirsky, Miki Hermann, Florian Richoux
CVPR
2009
IEEE
15 years 2 months ago
Reducing JointBoost-Based Multiclass Classification to Proximity Search
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
Alexandra Stefan (University of Texas at Arlington...
CVPR
2006
IEEE
14 years 9 months ago
Image-Based Multiclass Boosting and Echocardiographic View Classification
We tackle the problem of automatically classifying cardiac view for an echocardiographic sequence as a multiclass object detection. As a solution, we present an imagebased multicl...
Shaohua Kevin Zhou, J. H. Park, Bogdan Georgescu, ...
CVPR
2005
IEEE
14 years 9 months ago
A Weighted Nearest Mean Classifier for Sparse Subspaces
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...
Cor J. Veenman, David M. J. Tax