497 search results - page 19 / 100 » Approximating max-min linear programs with local algorithms |
IPSN
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
75
Voted
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
BMCBI
2006
14 years 9 months ago
2006
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
FOCM
2007
14 years 9 months ago
2007
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...