4926 search results - page 188 / 986 » Two Graph Algorithms On an Associative Computing Model |
161
click to vote
FOCS
2009
IEEE
16 years 27 days ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
166
Voted
ICPP
1999
IEEE
15 years 10 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
190
click to vote
ISBI
2009
IEEE
16 years 29 days ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
147
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
213
Voted
BMCBI
2008
15 years 6 months ago
2008
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...