3958 search results - page 178 / 792 » Dynamic Graph Algorithms with Applications |
171
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
180
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
138
click to vote
GLOBECOM
2008
IEEE
16 years 28 days ago
2008
IEEE
Abstract—In modern DSL networks, crosstalk among different lines (i.e., users) is the major source of performance degradation. Dynamic Spectrum Management (DSM) refers to a set o...
192
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
194
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...