38 search results - page 4 / 8 » Worst-Case Versus Average Case Complexity of Ray-Shooting |
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
ECAI
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
IPCCC
2005
IEEE
14 years 1 months ago
2005
IEEE
The Double Authentication (DA) scheme presented in [1] is designed to provide security against impersonation attack to link state routing protocol at a lower computational cost as...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
SODA
1990
ACM
13 years 8 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...