Sciweavers

3405 search results - page 113 / 681
» Factoring Groups Efficiently
Sort
View
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
16 years 6 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
CN
2004
122views more  CN 2004»
15 years 6 months ago
Group rekeying with limited unicast recovery
In secure group communications, a key server can deliver a "grouporiented" rekey message [22] to a large number of users efficiently using multicast. For reliable delive...
X. Brian Zhang, Simon S. Lam, Dong-Young Lee
EUROCRYPT
2006
Springer
15 years 10 months ago
VSH, an Efficient and Provable Collision-Resistant Hash Function
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
Scott Contini, Arjen K. Lenstra, Ron Steinfeld
ADHOCNOW
2008
Springer
15 years 7 months ago
An Energy-Efficient Query Aggregation Scheme for Wireless Sensor Networks
This paper presents a novel method for optimizing sliding window based continuous queries. We deal with two categories of aggregation operations: stepwise aggregation (e.g. COUNT) ...
Jun-Zhao Sun
EC
2010
158views ECommerce» more  EC 2010»
15 years 3 months ago
An Efficient Algorithm for Computing Hypervolume Contributions
The hypervolume indicator serves as a sorting criterion in many recent multi-objective evolutionary algorithms (MOEAs). Typical algorithms remove the solution with the smallest lo...
Karl Bringmann, Tobias Friedrich