4926 search results - page 272 / 986 » Two Graph Algorithms On an Associative Computing Model |
178
click to vote
DAM
2000
15 years 6 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
145
click to vote
IUI
2004
ACM
15 years 11 months ago
2004
ACM
A key to improving at any task is frequent feedback from people whose opinions we care about: our family, friends, mentors, and the experts. However, such input is not usually ava...
195
click to vote
TVCG
2008
15 years 6 months ago
2008
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
143
click to vote
IPPS
2006
IEEE
16 years 8 days ago
2006
IEEE
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
173
click to vote
ICPR
2008
IEEE
16 years 20 days ago
2008
IEEE
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...