Sciweavers

6251 search results - page 365 / 1251
» Randomness, Computability, and Density
Sort
View
GRAPP
2011
14 years 6 months ago
Animation of Air Bubbles with SPH
We present a physically-based multiphase model for simulating water and air bubbles with Smoothed Particle Hydrodynamics (SPH). Since the high density ratio of air and water is pr...
Markus Ihmsen, Julian Bader, Gizem Akinci, Matthia...
INFOCOM
2005
IEEE
16 years 10 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
FOCS
2007
IEEE
16 years 1 months ago
Covert Multi-Party Computation
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, ...
RANDOM
1998
Springer
15 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
215
Voted
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
15 years 6 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial