455 search results - page 58 / 91 » A local approximation algorithm for maximum weight matching |
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
102
click to vote
BIBE
2005
IEEE
15 years 4 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
NIPS
2008
15 years 19 days ago
2008
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
100
click to vote
NIPS
1998
15 years 16 days ago
1998
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
110
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...