Sciweavers

175 search results - page 13 / 35
» max-cut and Containment Relations in Graphs
Sort
View
CSMR
2006
IEEE
14 years 2 months ago
Dynamic Object Process Graphs
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trac...
Jochen Quante, Rainer Koschke
ALT
2007
Springer
14 years 18 days ago
Cluster Identification in Nearest-Neighbor Graphs
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
Markus Maier, Matthias Hein, Ulrike von Luxburg
ARSCOM
2004
75views more  ARSCOM 2004»
13 years 8 months ago
On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
Stefan Szeider
3DPVT
2006
IEEE
194views Visualization» more  3DPVT 2006»
14 years 2 months ago
Histogram Matching for Camera Pose Neighbor Selection
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....
Kevin L. Steele, Parris K. Egbert, Bryan S. Morse
ICDAR
2003
IEEE
14 years 1 months ago
Graph Grammar Based Analysis System of Complex Table Form Document
Structure analysis of table form document is important because printed documents and also electronical documents only provide geometrical layout and lexical information explicitly...
Akira Amano, Naoki Asada