1172 search results - page 67 / 235 » Path Algorithms on Regular Graphs |
112
Voted
CPAIOR
2007
Springer
15 years 8 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
124
click to vote
WSDM
2010
ACM
15 years 11 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
131
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
115
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
Recently, a very appealing approach was proposed to compute the entire solution path for support vector classification (SVC) with very low extra computational cost. This approach ...
124
Voted
ICCAD
1994
IEEE
15 years 6 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...