7930 search results - page 243 / 1586 » Greedy in Approximation Algorithms |
159
click to vote
CASES
2006
ACM
16 years 15 days ago
2006
ACM
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
151
click to vote
ISER
2000
Springer
15 years 10 months ago
2000
Springer
: We discuss the applications of modular self-reconfigurable robots to navigation. We show that greedy algorithms are complete for motion planning over a class of modular reconfigu...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypot...
120
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
198
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...