15033 search results - page 206 / 3007 » Complexity Theory and Algorithms |
138
click to vote
PODS
2008
ACM
16 years 4 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...
146
click to vote
ALDT
2009
Springer
15 years 11 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 ...
131
click to vote
GECCO
2005
Springer
15 years 10 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. ...
144
click to vote
DIALM
2004
ACM
15 years 10 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 ...
139
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...