934 search results - page 111 / 187 » A theoretical analysis of the HIFF problem |
175
click to vote
CVPR
2012
IEEE
13 years 8 days ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
IJCV
2010
14 years 8 months ago
2010
We present an information theoretic approach to define the problem of structure from motion (SfM) as a blind source separation one. Given that for almost all practical joint densi...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult ...
ICDT
2003
ACM
15 years 3 months ago
2003
ACM
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
COMPGEOM
2009
ACM
15 years 2 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....