2463 search results - page 296 / 493 » Rankings of Directed Graphs |
131
click to vote
BIBE
2005
IEEE
15 years 9 months ago
2005
IEEE
We address the issue of providing highly informative annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a set of candidate ...
109
Voted
ICPPW
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper compares two methods for running an application composed of a set of modules on a grid. The set of modules (collectively called Montage) generates large astronomical im...
154
Voted
WAIM
2004
Springer
15 years 8 months ago
2004
Springer
Data mining extracts implicit, previously unknown and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most ...
146
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
172
click to vote
ISPAN
2002
IEEE
15 years 8 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...