1986 search results - page 284 / 398 » Path Separability of Graphs |
171
Voted
ICCV
1999
IEEE
16 years 3 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
ICIP
2009
IEEE
16 years 3 months ago
2009
IEEE
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
125
click to vote
VLSID
2002
IEEE
16 years 2 months ago
2002
IEEE
Clock selection has a significant impact on the performance and quality of designs in high-level synthesis. In most synthesis systems, a convenient value of the clock is chosen or...
125
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
109
click to vote
ICRA
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...