Sciweavers

2735 search results - page 279 / 547
» Comparing notions of randomness
Sort
View
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
14 years 4 months ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
David J. Pearce, Paul H. J. Kelly
CSB
2003
IEEE
110views Bioinformatics» more  CSB 2003»
14 years 4 months ago
Prokaryote Phylogeny without Sequence Alignment: From Avoidance Signature to Composition Distance
A new and essentially simple method to reconstruct prokaryotic phylogenetic trees from their complete genome data without using sequence alignment is proposed. It is based on the ...
Bailin Hao, Ji Qi
HOTOS
2003
IEEE
14 years 4 months ago
An Analysis of Compare-by-hash
Recent research has produced a new and perhaps dangerous technique for uniquely identifying blocks that I will call compare-by-hash. Using this technique, we decide whether two bl...
Val Henson
ICDAR
2003
IEEE
14 years 4 months ago
Investigation of Off-Line Japanese Signature Verification Using a Pattern Matching
This paper deals with an off-line Japanese signature verification using a pattern matching method. An annoying problem encountered in off-line signature verification using a patte...
Katsuhiko Ueda
ISVLSI
2003
IEEE
157views VLSI» more  ISVLSI 2003»
14 years 4 months ago
Joint Minimization of Power and Area in Scan Testing by Scan Cell Reordering
This paper describes a technique for re-ordering of scan cells to minimize power dissipation that is also capable of reducing the area overhead of the circuit compared to a random...
Shalini Ghosh, Sugato Basu, Nur A. Touba