25041 search results - page 4861 / 5009 » Algorithms for Clustering Data |
135
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
136
Voted
INFOCOM
2011
IEEE
14 years 6 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
169
Voted
IWMM
2011
Springer
14 years 5 months ago
2011
Springer
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
157
Voted
POPL
2011
ACM
14 years 5 months ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
153
Voted
PVLDB
2011
14 years 5 months ago
2011
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...