Sciweavers

233 search results - page 27 / 47
» An Investigation of Practical Approximate Nearest Neighbor A...
Sort
View
100
Voted
IBPRIA
2003
Springer
15 years 5 months ago
Supervised Locally Linear Embedding Algorithm for Pattern Recognition
The dimensionality of the input data often far exceeds their intrinsic dimensionality. As a result, it may be difficult to recognize multidimensional data, especially if the number...
Olga Kouropteva, Oleg Okun, Matti Pietikäinen
107
Voted
MOBIHOC
2010
ACM
14 years 10 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
110
Voted
ICCV
2005
IEEE
16 years 2 months ago
Object Recognition in High Clutter Images Using Line Features
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
Philip David, Daniel DeMenthon
119
Voted
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
13 years 2 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
120
Voted
IDA
2005
Springer
15 years 6 months ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
Eyke Hüllermeier, Jürgen Beringer