Sciweavers

1153 search results - page 138 / 231
» Reversing graph transformations
Sort
View
120
Voted
TCSV
2008
202views more  TCSV 2008»
15 years 17 days ago
Probabilistic Object Tracking With Dynamic Attributed Relational Feature Graph
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...
Feng Tang, Hai Tao
SAC
2005
ACM
15 years 6 months ago
Estimating manifold dimension by inversion error
Video and image datasets can often be described by a small number of parameters, even though each image usually consists of hundreds or thousands of pixels. This observation is of...
Shawn Martin, Alex Bäcker
103
Voted
WWW
2006
ACM
16 years 1 months ago
Using graph matching techniques to wrap data from PDF documents
Wrapping is the process of navigating a data source, semiautomatically extracting data and transforming it into a form suitable for data processing applications. There are current...
Tamir Hassan, Robert Baumgartner
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 5 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
101
Voted
EJC
2010
15 years 22 days ago
The edge-flipping group of a graph
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
Hau-wen Huang, Chih-wen Weng