Sciweavers

1327 search results - page 82 / 266
» Path following algorithm for the graph matching problem
Sort
View
163
Voted
DCG
2010
289views more  DCG 2010»
15 years 1 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
120
Voted
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
15 years 11 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
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...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
121
Voted
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 1 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
15 years 8 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
114
Voted
WADS
2007
Springer
106views Algorithms» more  WADS 2007»
15 years 8 months ago
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...