Sciweavers

384 search results - page 28 / 77
» On s-hamiltonian-connected line graphs
Sort
View
WER
2007
Springer
14 years 2 months ago
Towards Variability Design as Decision Boundary Placement
Complex information systems have numerous design variables that are systematically decided upon during the design process. In high-variability systems, some of these decisions are...
Catalin Bidian, Eric S. K. Yu
ICDAR
2003
IEEE
14 years 1 months ago
Fast Lexicon-Based Word Recognition in Noisy Index Card Images
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
Simon M. Lucas, Gregory Patoulas, Andy C. Downton
JAPLL
2006
114views more  JAPLL 2006»
13 years 8 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
JGAA
2006
85views more  JGAA 2006»
13 years 8 months ago
A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitio...
Grant A. Cheston, Tjoen Seng Jap
APPML
2008
159views more  APPML 2008»
13 years 8 months ago
The rook problem on saw-toothed chessboards
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...
Hon-Chan Chen, Ting-Yem Ho