Sciweavers

5607 search results - page 372 / 1122
» Graph structure in the Web
Sort
View
ICPR
2008
IEEE
16 years 8 months ago
Object localization using affine invariant substructure constraints
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
Ahmed M. Elgammal, Ishani Chakraborty
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
16 years 1 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
COMPGEOM
2009
ACM
16 years 1 months ago
Minimum cuts and shortest homologous cycles
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
SEFM
2005
IEEE
16 years 11 days ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier
PADS
2004
ACM
16 years 7 days ago
Exploiting Symmetry for Partitioning Models in Parallel Discrete Event Simulation
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
Jan Lemeire, Bart Smets, Philippe Cara, Erik F. Di...