Sciweavers

1215 search results - page 181 / 243
» Combinatorics
Sort
View
COCOON
2008
Springer
14 years 11 months ago
Spreading Messages
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
Ching-Lueh Chang, Yuh-Dauh Lyuu
CPM
2008
Springer
143views Combinatorics» more  CPM 2008»
14 years 11 months ago
A Black Box for Online Approximate Pattern Matching
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
Raphaël Clifford, Klim Efremenko, Benny Porat...
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
14 years 11 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
TSMC
2008
119views more  TSMC 2008»
14 years 9 months ago
An Efficient Binary-Decision-Diagram-Based Approach for Network Reliability and Sensitivity Analysis
Abstract--Reliability and sensitivity analysis is a key component in the design, tuning, and maintenance of network systems. Tremendous research efforts have been expended in this ...
Liudong Xing
MLQ
1998
126views more  MLQ 1998»
14 years 9 months ago
Reverse Mathematics and Recursive Graph Theory
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
William I. Gasarch, Jeffry L. Hirst