Sciweavers

397 search results - page 54 / 80
» Towards Polynomial Lower Bounds for Dynamic Problems
Sort
View
JCO
2006
126views more  JCO 2006»
13 years 10 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
SENSYS
2004
ACM
14 years 3 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»
12 years 24 days 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...
WAOA
2004
Springer
91views Algorithms» more  WAOA 2004»
14 years 3 months ago
Pricing Network Edges to Cross a River
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
Alexander Grigoriev, Stan P. M. van Hoesel, Anton ...
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
14 years 2 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