1327 search results - page 148 / 266 » Path following algorithm for the graph matching problem |
119
Voted
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
123
Voted
GD
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
165
click to vote
IEEEMSP
2002
IEEE
15 years 8 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
122
click to vote
ICCAD
2005
IEEE
16 years 24 days ago
2005
IEEE
— The flip-chip package gives the highest chip density of any packaging method to support the pad-limited Application-Specific Integrated Circuit (ASIC) designs. In this paper,...
136
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...