Sciweavers

247 search results - page 46 / 50
» On Pseudorandom Generators in NC
Sort
View
FOCS
1998
IEEE
13 years 11 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
IMC
2005
ACM
14 years 1 months ago
Exploiting Underlying Structure for Detailed Reconstruction of an Internet-scale Event
Network “telescopes” that record packets sent to unused blocks of Internet address space have emerged as an important tool for observing Internet-scale events such as the spre...
Abhishek Kumar, Vern Paxson, Nicholas Weaver
ASIACRYPT
2006
Springer
13 years 11 months ago
On the (In)security of Stream Ciphers Based on Arrays and Modular Addition
Abstract. Stream ciphers play an important role in symmetric cryptology because of their suitability in high speed applications where block ciphers fall short. A large number of fa...
Souradyuti Paul, Bart Preneel
MCS
2005
Springer
14 years 29 days ago
A Probability Model for Combining Ranks
Mixed Group Ranks is a parametric method for combining rank based classiers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...
Ofer Melnik, Yehuda Vardi, Cun-Hui Zhang
HPCA
2006
IEEE
14 years 7 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal