1021 search results - page 121 / 205 » Fast Approximate PCPs |
144
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
134
click to vote
BTW
2007
Springer
15 years 7 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
144
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
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...
150
click to vote
ISM
2005
IEEE
15 years 8 months ago
2005
IEEE
— This paper presents a shape-based retrieval system and its application to infrared satellite images. A complete system is presented, from region extraction of a full hemisphere...
114
click to vote
COLT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...