Sciweavers

3105 search results - page 210 / 621
» The Path-Packing Structure of Graphs
Sort
View
130
Voted
TGIS
2002
103views more  TGIS 2002»
15 years 3 months ago
Integration of Space Syntax into GIS: New Perspectives for Urban Morphology
Although space syntax has been successfully applied to many urban GIS studies, there is still a need to develop robust algorithms that support the automated derivation of graph re...
Bin Jiang, Christophe Claramunt
ICPR
2008
IEEE
16 years 5 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»
15 years 10 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
15 years 10 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
15 years 9 months 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