Sciweavers

1596 search results - page 18 / 320
» Human-Guided Simple Search
Sort
View
130
Voted
CVPR
2010
IEEE
15 years 27 days ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
PET
2012
Springer
13 years 4 months ago
PRISM - Privacy-Preserving Search in MapReduce
We present PRISM, a privacy-preserving scheme for word search in cloud computing. In the face of a curious cloud provider, the main challenge is to design a scheme that achieves pr...
Erik-Oliver Blass, Roberto Di Pietro, Refik Molva,...
108
Voted
ICST
2009
IEEE
15 years 8 months ago
A Simple Coverage-Based Locator for Multiple Faults
Fault localization helps spotting faults in source code by exploiting automatically collected data. Deviating from other fault locators relying on hit spectra or test coverage inf...
Friedrich Steimann, Mario Bertschler
119
Voted
ISLPED
2006
ACM
73views Hardware» more  ISLPED 2006»
15 years 7 months ago
Substituting associative load queue with simple hash tables in out-of-order microprocessors
Buffering more in-flight instructions in an out-of-order microprocessor is a straightforward and effective method to help tolerate the long latencies generally associated with ...
Alok Garg, Fernando Castro, Michael C. Huang, Dani...
95
Voted
COMPGEOM
1996
ACM
15 years 6 months ago
Simple Traversal of a Subdivision Without Extra Storage
In this paper we show how to traverse a subdivision and to report all cells, edges and vertices, without making use of mark bits in the structure or a stack. We do this by perform...
Mark de Berg, René van Oostrum, Mark H. Ove...