Sciweavers

3820 search results - page 421 / 764
» Bounded Model Debugging
Sort
View
ASIACRYPT
2009
Springer
15 years 10 months ago
Secure Multi-party Computation Minimizing Online Rounds
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yun...
232
Voted
SIGAL
1990
273views Algorithms» more  SIGAL 1990»
15 years 8 months ago
Randomized Broadcast in Networks
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
Uriel Feige, David Peleg, Prabhakar Raghavan, Eli ...
136
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
Throughput, Delay, and Mobility in Wireless Ad Hoc Networks
—Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random ...
Pan Li, Yuguang Fang, Jie Li
TECS
2010
74views more  TECS 2010»
15 years 2 months ago
Recovering from distributable thread failures in distributed real-time Java
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...
Edward Curley, Binoy Ravindran, Jonathan Stephen A...
INFOCOM
2012
IEEE
13 years 6 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang