Sciweavers

477 search results - page 24 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
ECCV
2002
Springer
14 years 9 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
COMCOM
2006
96views more  COMCOM 2006»
13 years 7 months ago
Dynamic cache reconfiguration strategies for cluster-based streaming proxy
The high bandwidth and the relatively long-lived characteristics of digital video are key limiting factors in the wide-spread usage of streaming content over the Internet. The pro...
Yang Guo, Zihui Ge, Bhuvan Urgaonkar, Prashant J. ...
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Hierarchical routing over dynamic wireless networks
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
ICDCSW
2007
IEEE
14 years 1 months ago
Event Stream Processing with Out-of-Order Data Arrival
Complex event processing has become increasingly important in modern applications, ranging from supply chain management for RFID tracking to real-time intrusion detection. The goa...
Ming Li, Mo Liu, Luping Ding, Elke A. Rundensteine...
SIGMOD
2007
ACM
195views Database» more  SIGMOD 2007»
14 years 7 months ago
Effective variation management for pseudo periodical streams
Many database applications require the analysis and processing of data streams. In such systems, huge amounts of data arrive rapidly and their values change over time. The variati...
Lv-an Tang, Bin Cui, Hongyan Li, Gaoshan Miao, Don...