Sciweavers

168 search results - page 13 / 34
» Shape Analysis by Graph Decomposition
Sort
View
ICPR
2006
IEEE
14 years 11 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
ICPR
2008
IEEE
14 years 11 months ago
Generic scale-space process for handwriting documents analysis
This paper presents a generic architecture for handwriting documents analysis. It covers all analysis steps from the content description of the document (layout analysis, handwrit...
Guillaume Joutel, Hubert Emptoz, Véronique ...
FMCAD
2000
Springer
14 years 1 months ago
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
Roderick Bloem, Harold N. Gabow, Fabio Somenzi
LOPSTR
2007
Springer
14 years 4 months ago
Termination Analysis of Logic Programs Based on Dependency Graphs
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
Manh Thang Nguyen, Jürgen Giesl, Peter Schnei...
INFOCOM
2009
IEEE
14 years 4 months ago
Topological Data Processing for Distributed Sensor Networks with Morse-Smale Decomposition
Abstract—We are interested in topological analysis and processing of the large-scale distributed data generated by sensor networks. Naturally a large-scale sensor network is depl...
Xianjin Zhu, Rik Sarkar, Jie Gao