Sciweavers

2252 search results - page 161 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
133
Voted
DEXA
2003
Springer
135views Database» more  DEXA 2003»
15 years 8 months ago
On the Optimality of Holistic Algorithms for Twig Queries
Streaming XML documents has many emerging applications. However, in this paper, we show that the restrictions imposed by data streaming are too restrictive for processing twig quer...
Byron Choi, Malika Mahoui, Derick Wood
CDC
2009
IEEE
211views Control Systems» more  CDC 2009»
15 years 8 months ago
An event-triggered distributed primal-dual algorithm for Network Utility maximization
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
Pu Wan, Michael D. Lemmon
124
Voted
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
15 years 3 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
ICIP
2003
IEEE
16 years 5 months ago
A new rate-minimizing matching criterion and a fast algorithm for block motion estimation
We present a new block matching criterion for motion estimation in video coding that will give better encoded video quality than the commonly used sum of absolute differences (SAD...
Tuukka Toivonen, Janne Heikkilä
CCR
2008
94views more  CCR 2008»
15 years 3 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...