6365 search results - page 65 / 1273 » Fast Local Computation Algorithms |
ICPR
2002
IEEE
15 years 5 months ago
2002
IEEE
125
click to vote
WAOA
2010
Springer
14 years 10 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
115
Voted
HAPTICS
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
A new criterion based on Gaussian fields is introduced and applied to the task of automatic rigid registration of point-sets. The method defines a simple energy function, which is...
115
click to vote
INFOVIS
2002
IEEE
15 years 5 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...