Sciweavers

97 search results - page 18 / 20
» Tight lower bounds for halfspace range searching
Sort
View
IVC
2007
114views more  IVC 2007»
13 years 7 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
SIGMOD
2011
ACM
203views Database» more  SIGMOD 2011»
12 years 10 months ago
Effective data co-reduction for multimedia similarity search
Multimedia similarity search has been playing a critical role in many novel applications. Typically, multimedia objects are described by high-dimensional feature vectors (or point...
Zi Huang, Heng Tao Shen, Jiajun Liu, Xiaofang Zhou
SPAA
2005
ACM
14 years 1 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
IJCAI
2007
13 years 9 months ago
A Study of Residual Supports in Arc Consistency
In an Arc Consistency (AC) algorithm, a residual support, or residue, is a support that has been stored during a previous execution of the procedure which determines if a value is ...
Christophe Lecoutre, Fred Hemery
FGR
2004
IEEE
161views Biometrics» more  FGR 2004»
13 years 11 months ago
AdaBoost with Totally Corrective Updates for Fast Face Detection
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
Jan Sochman, Jiri Matas