Sciweavers

1161 search results - page 216 / 233
» Approximation schemes for clustering problems
Sort
View
ICDE
2011
IEEE
194views Database» more  ICDE 2011»
12 years 11 months ago
Representative skylines using threshold-based preference distributions
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, R...
ALGOSENSORS
2009
Springer
13 years 5 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
TKDE
2011
234views more  TKDE 2011»
13 years 2 months ago
The World in a Nutshell: Concise Range Queries
—With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PD...
Ke Yi, Xiang Lian, Feifei Li, Lei Chen 0002
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 7 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
TIT
2008
72views more  TIT 2008»
13 years 7 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski