4926 search results - page 103 / 986 » Two Graph Algorithms On an Associative Computing Model |
135
click to vote
CCCG
2008
15 years 3 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
140
click to vote
AINA
2004
IEEE
15 years 6 months ago
2004
IEEE
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
134
Voted
CODES
2006
IEEE
15 years 4 months ago
2006
IEEE
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...
136
click to vote
JMLR
2010
15 years 28 days ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
126
click to vote
ISCAS
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...