Sciweavers

316 search results - page 55 / 64
» The chromatic covering number of a graph
Sort
View
IEEECIT
2010
IEEE
13 years 5 months ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...
CN
2010
121views more  CN 2010»
13 years 4 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
DAM
2011
13 years 2 months ago
Weak sense of direction labelings and graph embeddings
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
Christine T. Cheng, Ichiro Suzuki
DAS
2010
Springer
13 years 11 months ago
A post-processing scheme for malayalam using statistical sub-character language models
Most of the Indian scripts do not have any robust commercial OCRs. Many of the laboratory prototypes report reasonable results at recognition/classification stage. However, word ...
Karthika Mohan, C. V. Jawahar

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount