Sciweavers

9888 search results - page 1802 / 1978
» Active Algorithm Selection
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 10 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 10 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 9 months ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
MOBISYS
2010
ACM
15 years 8 months ago
CrowdSearch: exploiting crowds for accurate real-time image search on mobile phones
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
Tingxin Yan, Vikas Kumar, Deepak Ganesan
MOBISYS
2010
ACM
15 years 8 months ago
NAPman: network-assisted power management for wifi devices
WiFi radios in smart-phones consume a significant amount of power when active. The 802.11 standard allows these devices to save power through an energy-conserving Power Save Mode ...
Eric Rozner, Vishnu Navda, Ramachandran Ramjee, Sh...
« Prev « First page 1802 / 1978 Last » Next »