Sciweavers

366 search results - page 11 / 74
» Dynamic Programming for Graphs on Surfaces
Sort
View
CVPR
2003
IEEE
14 years 13 hour ago
Surface Reconstruction via Helmholtz Reciprocity with a Single Image Pair
This paper brings a novel method for three-dimensional reconstruction of surfaces that takes advantage of the symmetry resulting from alternating the positions of a camera and a l...
Peter H. Tu, Paulo R. S. Mendonça
CC
2007
Springer
14 years 27 days ago
Correcting the Dynamic Call Graph Using Control-Flow Constraints
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
Byeongcheol Lee, Kevin Resnick, Michael D. Bond, K...
FMOODS
2003
13 years 8 months ago
Towards Object-Oriented Graphs and Grammars
This work aims to extend the algebraical approach to graph transformation to model object-oriented systems structures and computations. A graph grammar based formal framework for o...
Ana Paula Lüdtke Ferreira, Leila Ribeiro
VL
1994
IEEE
154views Visual Languages» more  VL 1994»
13 years 10 months ago
Stretch-A-Sketch: a Dynamic Diagrammer
Stretch-A-Sketch is a pen-based drawing program that combines recognition of hand-drawn glyphs with constraint based maintenance of spatial relations. The recognition program iden...
Mark D. Gross
CORR
1999
Springer
145views Education» more  CORR 1999»
13 years 6 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein