Sciweavers

1327 search results - page 83 / 266
» Path following algorithm for the graph matching problem
Sort
View
SIBGRAPI
2008
IEEE
15 years 8 months ago
Structural Matching of 2D Electrophoresis Gels using Graph Models
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
15 years 8 months ago
Faster Approximation of Distances in Graphs
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 ...
Piotr Berman, Shiva Prasad Kasiviswanathan
130
Voted
PAMI
2006
168views more  PAMI 2006»
15 years 1 months ago
Graphical Models and Point Pattern Matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Tibério S. Caetano, Terry Caelli, Dale Schu...
104
Voted
APPROX
2007
Springer
80views Algorithms» more  APPROX 2007»
15 years 5 months ago
Coarse Differentiation and Multi-flows in Planar Graphs
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...
James R. Lee, Prasad Raghavendra
SAC
2006
ACM
15 years 7 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi