2168 search results - page 262 / 434 » Randomized Algorithms and Complexity Theory |
147
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
127
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
141
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
122
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
In this study, we introduce two improved assessment metrics of multiobjective optimizers, Nondominated Ratio and Spacing Distribution, and analyze their rationality and validity. ...
130
Voted
DIALM
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...