1261 search results - page 22 / 253 » Approximation algorithms for aligning points |
125
click to vote
SIAMJO
2008
15 years 2 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
107
click to vote
NIPS
2007
15 years 3 months ago
2007
We study the relation between notions of game-theoretic equilibria which are based on stability under a set of deviations, and empirical equilibria which are reached by rational p...
161
click to vote
ARITH
2009
IEEE
15 years 6 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
121
Voted
CIBCB
2007
IEEE
15 years 8 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
127
click to vote
JGAA
2000
15 years 2 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...