Sciweavers

13214 search results - page 88 / 2643
» Pseudorandomness for network algorithms
Sort
View
ANTSW
2006
Springer
15 years 10 months ago
An Analysis of the Different Components of the AntHocNet Routing Algorithm
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
FLAIRS
2006
15 years 7 months ago
Generating Realistic Large Bayesian Networks by Tiling
In this paper we present an algorithm and software for generating arbitrarily large Bayesian Networks by tiling smaller real-world known networks. The algorithm preserves the stru...
Ioannis Tsamardinos, Alexander R. Statnikov, Laura...
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
16 years 6 months ago
MCDB: a monte carlo approach to managing uncertain data
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Per...
PODS
2003
ACM
156views Database» more  PODS 2003»
16 years 6 months ago
Limiting privacy breaches in privacy preserving data mining
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
Alexandre V. Evfimievski, Johannes Gehrke, Ramakri...
DATE
2008
IEEE
148views Hardware» more  DATE 2008»
16 years 25 days ago
On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen