1215 search results - page 181 / 243 » Combinatorics |
166
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
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...
179
click to vote
CPM
2008
Springer
15 years 7 months ago
2008
Springer
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 ...
148
click to vote
CPM
2008
Springer
15 years 7 months ago
2008
Springer
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...
174
click to vote
TSMC
2008
2008
An Efficient Binary-Decision-Diagram-Based Approach for Network Reliability and Sensitivity Analysis
15 years 5 months ago
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 ...
170
click to vote
MLQ
1998
15 years 5 months ago
1998
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...