145 search results - page 19 / 29 » On finding approximate optimal paths in weighted regions |
CORR
2012
Springer
12 years 3 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
13 years 9 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...
GECCO
2003
Springer
14 years 21 days 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
14 years 29 days 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...
ICDE
2009
IEEE
14 years 2 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...