3894 search results - page 662 / 779 » Approximation Algorithms for Biclustering Problems |
161
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...
147
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...
126
click to vote
NIPS
2007
15 years 4 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 ...
137
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. ...
115
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...