Sciweavers

4192 search results - page 753 / 839
» Efficient testing of groups
Sort
View
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
14 years 1 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 1 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
ICDCS
2010
IEEE
14 years 1 months ago
Sentomist: Unveiling Transient Sensor Network Bugs via Symptom Mining
—Wireless Sensor Network (WSN) applications are typically event-driven. While the source codes of these applications may look simple, they are executed with a complicated concurr...
Yangfan Zhou, Xinyu Chen, Michael R. Lyu, Jiangchu...
HUC
2009
Springer
14 years 1 months ago
Playful bottle: a mobile social persuasion system to motivate healthy water intake
This study of mobile persuasion system explores the use of a mobile phone, when attached to an everyday object used by an everyday behavior, becomes a tool to sense and influence ...
Meng-Chieh Chiu, Shih-Ping Chang, Yu-Chen Chang, H...
ANTSW
2004
Springer
14 years 28 days ago
Mesh-Partitioning with the Multiple Ant-Colony Algorithm
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
Peter Korosec, Jurij Silc, Borut Robic