Sciweavers

1456 search results - page 145 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
PPOPP
2010
ACM
14 years 5 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
11 years 10 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
JSA
2006
113views more  JSA 2006»
13 years 8 months ago
A power-efficient TCAM architecture for network forwarding tables
Stringent memory access and search speed requirements are two of the main bottlenecks in wire speed processing. Most viable search engines are implemented in content addressable m...
Taskin Koçak, Faysal Basci
CIKM
2011
Springer
12 years 8 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...
WWW
2006
ACM
14 years 8 months ago
Generating query substitutions
We introduce the notion of query substitution, that is, generating a new query to replace a user's original search query. Our technique uses modifications based on typical su...
Rosie Jones, Benjamin Rey, Omid Madani, Wiley Grei...