Sciweavers

1772 search results - page 66 / 355
» Classifying Problems into Complexity Classes
Sort
View
79
Voted
ICCV
2003
IEEE
16 years 2 months ago
Surface Classification Using Conformal Structures
3D surface classification is a fundamental problem in computer vision and computational geometry. Surfaces can be classified by different transformation groups. Traditional classi...
Xianfeng Gu, Shing-Tung Yau
78
Voted
EMNLP
2006
15 years 1 months ago
Identification of Event Mentions and their Semantic Class
Complex tasks like question answering need to be able to identify events in text and the relations among those events. We show that this event identification task and a related ta...
Steven Bethard, James H. Martin
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
16 years 28 days ago
Computer aided detection via asymmetric cascade of sparse hyperplane classifiers
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
Jinbo Bi, Senthil Periaswamy, Kazunori Okada, Tosh...
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 19 days ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...
121
Voted
FOCS
1998
IEEE
15 years 4 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello