26 search results - page 5 / 6 » A Generalized Coupon Collector Problem |
CORR
2006
Springer
2006
Springer
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
13 years 9 months ago
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
PLDI
2006
ACM
14 years 3 months ago
2006
ACM
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
KDD
2009
ACM
14 years 10 months ago
2009
ACM
The availability and the accuracy of the data dictate the success of a data mining application. Increasingly, there is a need to resort to on-line data collection to address the p...
IWMM
2007
Springer
14 years 4 months ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
WINET
2010
13 years 8 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...