2520 search results - page 280 / 504 » The complexity of approximating entropy |
149
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
166
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
191
click to vote
BROADNETS
2007
IEEE
16 years 29 days ago
2007
IEEE
Abstract— Limited resources and time-varying nature of wireless ad hoc networks demand optimized use of resources across layers. Cross-layer optimization (CLO) for wireless netwo...
199
click to vote
INFOCOM
2006
IEEE
16 years 19 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
167
Voted
COMPGEOM
2006
ACM
16 years 17 days ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...