3134 search results - page 52 / 627 » Computing full disjunctions |
122
click to vote
KDD
2004
ACM
16 years 2 months ago
2004
ACM
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
108
click to vote
ASPLOS
2000
ACM
15 years 6 months ago
2000
ACM
Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effec...
88
Voted
DCC
2007
IEEE
16 years 1 months ago
2007
IEEE
We explore the Full Compressed Delta Encoding problem in compressed texts, defined as the problem of constructing a delta file directly from the two given compressed files, withou...
DSN
2007
IEEE
15 years 8 months ago
2007
IEEE
Full duplication of an entire application (through spatial or temporal redundancy) would detect many errors that are benign to the application from the perspective of the end-user...
157
Voted
WACV
2012
IEEE
13 years 10 months ago
2012
IEEE
We present a novel algorithm, Compact Kd-Trees (CompactKdt), that achieves state-of-the-art performance in searching large scale object image collections. The algorithm uses an or...