1402 search results - page 249 / 281 » Searching Cycle-Disjoint Graphs |
RECOMB
2007
Springer
15 years 10 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
167
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
HT
2009
ACM
15 years 4 months ago
2009
ACM
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
CRV
2008
IEEE
15 years 4 months ago
2008
IEEE
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...