3652 search results - page 468 / 731 » A study of query length |
186
click to vote
STACS
2004
Springer
16 years 15 hour ago
2004
Springer
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
144
click to vote
STACS
2004
Springer
16 years 15 hour ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
132
click to vote
FOCS
2003
IEEE
15 years 12 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...
139
click to vote
HICSS
2003
IEEE
15 years 12 months ago
2003
IEEE
The recent interest in ad hoc networks, in general, and in the Bluetooth technology, in particular, has stimulated much research in algorithms for topology control of such network...
172
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— We present a detailed analysis of the loss performance in an optical buffer having access to a single outgoing channel. Such a system - consisting of a number of fiber delay li...