145 search results - page 19 / 29 » On finding approximate optimal paths in weighted regions |
103
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
CIMAGING
2008
15 years 1 months ago
2008
Medical imaging typically requires the reconstruction of a limited region of interest (ROI) to obtain a high resolution image of the anatomy of interest. Although targeted reconst...
143
click to vote
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
SCIA
2005
Springer
15 years 5 months ago
2005
Springer
Clustering algorithms are intensively used in the image analysis field in compression, segmentation, recognition and other tasks. In this work we present a new approach in clusteri...
105
click to vote
ICDE
2009
IEEE
15 years 6 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...