Sciweavers

2385 search results - page 161 / 477
» Sense of Direction in Distributed Computing
Sort
View
AGP
1995
IEEE
15 years 4 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella
UAI
2008
15 years 1 months ago
Almost Optimal Intervention Sets for Causal Discovery
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
Frederick Eberhardt
108
Voted
IACR
2011
115views more  IACR 2011»
14 years 4 days ago
Pseudorandom Functions and Lattices
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
Abhishek Banerjee, Chris Peikert, Alon Rosen
90
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Delivery Properties of Human Social Networks
—The recently proposed Pocket Switched Network paradigm takes advantage of human social contacts to opportunistically create data paths over time. We examine how effective such a...
Nishanth Sastry, Karen R. Sollins, Jon Crowcroft
ICPP
2009
IEEE
15 years 7 months ago
Performance Limits of Fair-Access in Underwater Sensor Networks
—This paper investigates fundamental performance limits of medium access control (MAC) protocols for particular underwater multi-hop sensor networks under a fair-access criterion...
Yang Xiao, Miao Peng, John H. Gibson, Geoffrey G. ...