Sciweavers

2131 search results - page 346 / 427
» Immunity for Closed Sets
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 4 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
INFOCOM
2000
IEEE
15 years 4 months ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 4 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
ICPADS
1998
IEEE
15 years 4 months ago
User-Defined Telecooperation Services
A user-defined telecooperation service (UTS) provides service elements for application-specific communication and cooperation processes as well as integrated means for the service...
Volker Gruhn, Peter Herrmann, Heiko Krumm
INFOCOM
1998
IEEE
15 years 4 months ago
Informed-Source Coding-on-Demand (ISCOD) over Broadcast Channels
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
Yitzhak Birk, Tomer Kol