738 search results - page 41 / 148 » cases 2001 |
77
Voted
PPAM
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
CPM
2001
Springer
15 years 2 months ago
2001
Springer
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
DEXA
2001
Springer
15 years 2 months ago
2001
Springer
Caching issues in meta-search engines are considered. We propose a popularity-driven cache algorithm that utilizes both popularities and reference counters of queries to determine ...
96
Voted
WAE
2001
14 years 11 months ago
2001
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speci c properties of Glushkov's nondeterministic nite automaton (NFA) construction alg...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...