Sciweavers

4066 search results - page 410 / 814
» Almost Complete Sets
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 9 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
TMC
2012
13 years 9 months ago
Mobile Data Offloading through Opportunistic Communications and Social Participation
—3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communicatio...
Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marat...
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
16 years 7 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
16 years 7 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
187
Voted
EDBT
2004
ACM
268views Database» more  EDBT 2004»
16 years 7 months ago
DBDC: Density Based Distributed Clustering
Abstract. Clustering has become an increasingly important task in modern application domains such as marketing and purchasing assistance, multimedia, molecular biology as well as m...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle