2001 search results - page 248 / 401 » Local solutions for global problems in wireless networks |
156
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
179
click to vote
ICVGIP
2004
15 years 7 months ago
2004
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...
206
click to vote
JMLR
2012
13 years 8 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
142
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. Current numerical methods for assessing the statistical significance of local alignments with gaps are time consuming. Analytical solutions thus far have been limited to ...
186
click to vote
SIAMJO
2002
15 years 6 months ago
2002
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Ex...