2536 search results - page 41 / 508 » Constructing Optimal Highways |
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
CRYPTO
2003
Springer
14 years 3 months ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
CRYPTO
2000
Springer
14 years 1 months ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
WSC
2008
14 years 8 days ago
2008
Simulation techniques can provide a resource-driven schedule and answer many hypothetical scenarios before project execution to improve on conventional project management software...
GLOBECOM
2007
IEEE
13 years 10 months ago
2007
IEEE
— In this paper, we introduce a network multicast problem called the alternating multicast problem. In this problem, there is more than one multicast on the network, but only one...