7129 search results - page 500 / 1426 » Approximation Algorithms for Treewidth |
192
click to vote
ISMIR
2005
Springer
16 years 9 days ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
181
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
In the model-based policy search approach to reinforcement learning (RL), policies are found using a model (or "simulator") of the Markov decision process. However, for ...
176
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
181
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
188
Voted
ICDCS
2006
IEEE
16 years 26 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...