Sciweavers

10 search results - page 2 / 2
» Cell Probe Lower Bounds and Approximations for Range Mode
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 5 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
13 years 11 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
COMCOM
2006
165views more  COMCOM 2006»
13 years 5 months ago
Analysis of a topology control paradigm in WLAN/WPAN environments
The coordinated coexistence of WLANs and WPANs in a dual-mode network is a recently introduced idea and is expected to increase the overall system performance by allowing for the ...
Athanasios Vaios, Konstantinos Oikonomou, Ioannis ...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
13 years 10 months 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...
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
13 years 11 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen