1172 search results - page 162 / 235 » Path Algorithms on Regular Graphs |
124
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
170
click to vote
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...
116
click to vote
ECCC
2006
15 years 2 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
119
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
169
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...