Sciweavers

64 search results - page 7 / 13
» Efficient Computation in Groups Via Compression
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
AINA
2010
IEEE
14 years 15 days ago
Encoding and Compression for the Devices Profile for Web Services
—Most solutions for Wireless Sensor Networks (WSN) come equipped with their own architectural concepts which raise the problem of possible incompatibility of computer networks an...
Guido Moritz, Dirk Timmermann, Regina Stoll, Frank...
EUROCRYPT
2009
Springer
14 years 8 months ago
Asymmetric Group Key Agreement
A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish...
Qianhong Wu, Yi Mu, Willy Susilo, Bo Qin, Josep Do...
DEBS
2008
ACM
13 years 9 months ago
Event dissemination via group-aware stream filtering
We consider a distributed system that disseminates highvolume event streams to many simultaneous monitoring applications over a low-bandwidth network. For bandwidth efficiency, we...
Ming Li, David Kotz
ACSC
2007
IEEE
14 years 1 months ago
Architecture of a Web Accelerator For Wireless Networks
With the continuous growth of mobile users and web-based wireless applications, the performance of accessing web services via wireless is becoming one of the key issues. Regular T...
Jian Song, Yanchun Zhang