2004 search results - page 110 / 401 » Sampling from large graphs |
128
click to vote
ICRA
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
108
click to vote
GBRPR
2007
Springer
15 years 9 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
145
click to vote
MICCAI
2009
Springer
15 years 7 months ago
2009
Springer
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an e...
120
click to vote
ICDM
2007
IEEE
15 years 9 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
146
click to vote
WAIM
2004
Springer
15 years 8 months ago
2004
Springer
Data mining extracts implicit, previously unknown and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most ...