Sciweavers

126 search results - page 8 / 26
» Consistent graph layout for weighted graphs
Sort
View
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
CORR
2012
Springer
249views Education» more  CORR 2012»
12 years 4 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
14 years 3 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
JMM2
2006
141views more  JMM2 2006»
13 years 8 months ago
Optimal Weighting of Landmarks for Face Recognition
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landm...
Rajinda Senaratne, Saman K. Halgamuge
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
14 years 4 days ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...