37 search results - page 6 / 8 » Tight lower bounds for selection in randomly ordered streams |
WEA
2010
Springer
13 years 11 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
SIGMOD
2008
ACM
14 years 6 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
MOBIHOC
2008
ACM
14 years 5 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
SIGECOM
2009
ACM
14 years 9 days ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...