Sciweavers

13214 search results - page 2264 / 2643
» Pseudorandomness for network algorithms
Sort
View
COMCOM
2002
189views more  COMCOM 2002»
15 years 6 months ago
Intrusion detection techniques and approaches
Recent security incidents and analysis have demonstrated that manual response to such attacks is no longer feasible. Intrusion Detection systems offer techniques for modelling and...
Theuns Verwoerd, Ray Hunt
FGCS
2000
93views more  FGCS 2000»
15 years 6 months ago
Sharing objects in a distributed, single address space environment
With reference to an object type defining the two basic operations, read and write, we present solutions to the object sharing problem, classified according to the migration and/o...
Gianluca Dini, Lanfranco Lopriore
IJUFKS
2000
111views more  IJUFKS 2000»
15 years 6 months ago
A Factorized Representation of Independence of Causal Influence and Lazy Propagation
Theefficiency of algorithmsfor probabilistic inference in Bayesian networks can be improvedby exploiting independenceof causal influence. Thefactorized representation of independe...
Anders L. Madsen, Bruce D'Ambrosio
CCR
1998
96views more  CCR 1998»
15 years 6 months ago
On routes and multicast trees in the Internet
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
Jean-Jacques Pansiot, Dominique Grad
JAIR
2002
120views more  JAIR 2002»
15 years 6 months ago
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap
Hidden Markov models hmms and partially observable Markov decision processes pomdps provide useful tools for modeling dynamical systems. They are particularly useful for represent...
Hagit Shatkay, Leslie Pack Kaelbling
« Prev « First page 2264 / 2643 Last » Next »