Sciweavers

175 search results - page 25 / 35
» Lower Bounds for Dynamic Algebraic Problems
Sort
View
SENSYS
2004
ACM
14 years 1 months ago
The dynamic behavior of a data dissemination protocol for network programming at scale
To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over...
Jonathan W. Hui, David E. Culler
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 10 months ago
Searching and mining trillions of time series subsequences under dynamic time warping
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
Thanawin Rakthanmanon, Bilson J. L. Campana, Abdul...
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
13 years 12 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
13 years 9 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...
INFOCOM
2008
IEEE
14 years 2 months ago
Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks
—A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multihop wireless networks is discussed. The goal of maximizing a utili...
Simone Merlin, Nitin H. Vaidya, Michele Zorzi