Sciweavers

6274 search results - page 914 / 1255
» From query complexity to computational complexity
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 7 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
IJCV
2000
180views more  IJCV 2000»
15 years 7 months ago
Probabilistic Models of Appearance for 3-D Object Recognition
We describe how to model the appearance of a 3-D object using multiple views, learn such a model from training images, and use the model for object recognition. The model uses pro...
Arthur R. Pope, David G. Lowe
GRAMMARS
1998
111views more  GRAMMARS 1998»
15 years 7 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai
JACM
1998
88views more  JACM 1998»
15 years 7 months ago
A Threshold of ln n for Approximating Set Cover
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
Uriel Feige
PR
2007
118views more  PR 2007»
15 years 6 months ago
A cooperative constructive method for neural networks for pattern recognition
In this paper, we propose a new constructive method, based on cooperative coevolution, for designing automatically the structure of a neural network for classification. Our appro...
Nicolás García-Pedrajas, Domingo Ort...