2168 search results - page 251 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
238
click to vote
PODS
2009
ACM
16 years 5 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
165
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
120
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
148
click to vote
GFKL
2007
Springer
15 years 8 months ago
2007
Springer
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
134
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
This paper describes a discriminatively trained, multiscale, deformable part model for object detection. Our system achieves a two-fold improvement in average precision over the b...