Sciweavers

596 search results - page 29 / 120
» Complexity Analysis by Graph Rewriting
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
13 years 11 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
DGCI
2006
Springer
13 years 11 months ago
Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
Antoine Vacavant, David Coeurjolly, Laure Tougne
ICCD
1995
IEEE
121views Hardware» more  ICCD 1995»
13 years 11 months ago
Analysis of conditional resource sharing using a guard-based control representation
Optimization of hardware resources for conditional data-flow graph behavior is particularly important when conditional behavior occurs in cyclic loops and maximization of through...
Ivan P. Radivojevic, Forrest Brewer
ICPR
2006
IEEE
14 years 9 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
CSR
2008
Springer
13 years 8 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril