Sciweavers

149 search results - page 7 / 30
» Uniform hashing in constant time and linear space
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 8 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
JCSS
2000
116views more  JCSS 2000»
13 years 7 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
TCS
1998
13 years 7 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
JNW
2006
120views more  JNW 2006»
13 years 7 months ago
An EMST Based Look-up Protocol for Peer to Peer Networks
-- Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems a...
Tarun Bansal, Pankaj Ghanshani
CVPR
2010
IEEE
14 years 3 months ago
Efficient Filter Flow for Space-Variant Multiframe Blind Deconvolution
Ultimately being motivated by facilitating space-variant blind deconvolution, we present a class of linear transformations, that are expressive enough for space-variant filters, ...
Michael Hirsch, Suvrit Sra, Bernhard Schöpf, Stef...