4926 search results - page 373 / 986 » Two Graph Algorithms On an Associative Computing Model |
150
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 21 days ago
2010
Eurographics
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
153
Voted
PEWASUN
2004
ACM
15 years 10 months ago
2004
ACM
Interferences in an ad-hoc network can be defined as a set of constraints that specify which groups of nodes cannot transmit simultaneously, and they have significant implications...
153
Voted
COMPLEX
2009
Springer
15 years 8 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
164
click to vote
SMI
2006
IEEE
15 years 10 months ago
2006
IEEE
Surface matching is a common task in computer graphics and computer vision. In this paper, we introduce a novel algorithm that aligns scanned point-based surfaces to the related 3...
167
click to vote
GAMESEC
2010
15 years 2 months ago
2010
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...