Sciweavers

323 search results - page 31 / 65
» Distributed Verification and Hardness of Distributed Approxi...
Sort
View
FOCS
2004
IEEE
13 years 11 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
OOPSLA
2010
Springer
13 years 5 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
SIGSOFT
2010
ACM
13 years 5 months ago
Software intelligence: the future of mining software engineering data
Mining software engineering data has emerged as a successful research direction over the past decade. In this position paper, we advocate Software Intelligence (SI) as the future ...
Ahmed E. Hassan, Tao Xie
PE
2010
Springer
133views Optimization» more  PE 2010»
13 years 6 months ago
Positive Harris recurrence and diffusion scale analysis of a push pull queueing network
We consider a push pull queueing system with two servers and two types of jobs which are processed by the two servers in opposite order, with stochastic generally distributed proc...
Yoni Nazarathy, Gideon Weiss
MOBIHOC
2010
ACM
13 years 5 months ago
On quality of monitoring for multi-channel wireless infrastructure networks
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
Arun Chhetri, Huy Anh Nguyen, Gabriel Scalosub, Ro...