1327 search results - page 114 / 266 » Path following algorithm for the graph matching problem |
104
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
139
click to vote
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper presents a novel two-phase stereo matching algorithm using the random walks framework. At first, a set of reliable matching pixels is extracted with prior matrices de...
114
click to vote
CCCG
2001
15 years 3 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
116
Voted
SODA
1997
ACM
15 years 3 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...