693 search results - page 89 / 139 » Minimization and Partitioning Method Reducing Input Sets |
120
click to vote
KDD
2006
ACM
16 years 1 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
85
Voted
DCC
2008
IEEE
16 years 1 months ago
2008
IEEE
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
128
click to vote
ICCV
2007
IEEE
15 years 7 months ago
2007
IEEE
We introduce a non-linear shape prior for the deformable model framework that we learn from a set of shape samples using recent manifold learning techniques. We model a category o...
132
Voted
ICCV
1999
IEEE
15 years 5 months ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
KDD
2002
ACM
16 years 1 months ago
2002
ACM
In this paper, we propose a new approach to discover informative contents from a set of tabular documents (or Web pages) of a Web site. Our system, InfoDiscoverer, first partition...