5595 search results - page 966 / 1119 » Approximation Algorithms for Clustering Problems |
161
click to vote
NIPS
2007
15 years 7 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 ...
170
click to vote
BMCBI
2005
15 years 6 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. ...
172
Voted
ICCAD
2009
IEEE
15 years 3 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...
148
click to vote
GECCO
2006
Springer
15 years 9 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...
170
click to vote
INFOCOM
2007
IEEE
16 years 11 days ago
2007
IEEE
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...