1688 search results - page 179 / 338 » Computational Perspectives on Map Generalization |
172
click to vote
ISVC
2005
Springer
15 years 12 months ago
2005
Springer
This paper presents a new method for projecting a mesh model of a source object onto a surface of an arbitrary target object. A deformable model, called Self-organizing Deformable ...
190
click to vote
JMLR
2010
15 years 1 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
181
click to vote
INFOCOM
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
163
click to vote
CGF
2007
15 years 6 months ago
2007
This paper describes a fast rendering algorithm for verification of spectacle lens design. Our method simulates refraction corrections of astigmatism as well as myopia or presbyo...
172
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...