3874 search results - page 655 / 775 » Approximation Algorithms for k-hurdle Problems |
162
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
148
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
128
Voted
NIPS
2007
15 years 5 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
138
Voted
BMCBI
2005
15 years 3 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
138
Voted
ICCAD
2009
IEEE
15 years 1 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...