Sciweavers

477 search results - page 52 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
15 years 10 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
SIGMOD
2005
ACM
77views Database» more  SIGMOD 2005»
15 years 10 months ago
On Joining and Caching Stochastic Streams
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Jun Yang 0001, Junyi Xie, Yuguo Chen
VLDB
2001
ACM
90views Database» more  VLDB 2001»
15 years 2 months ago
Update Propagation Strategies for Improving the Quality of Data on the Web
Dynamically generated web pages are ubiquitous today but their high demand for resources creates a huge scalability problem at the servers. Traditional web caching is not able to ...
Alexandros Labrinidis, Nick Roussopoulos
ICDE
2011
IEEE
235views Database» more  ICDE 2011»
14 years 1 months ago
Fast data analytics with FPGAs
—The rapidly increasing amount of data available for real-time analysis (i.e., so-called operational business intelligence) is creating an interesting opportunity for creative ap...
Louis Woods, Gustavo Alonso
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 11 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...