Sciweavers

226 search results - page 26 / 46
» Approximate Clustering on Distributed Data Streams
Sort
View
MMS
2000
13 years 7 months ago
Failure Recovery Algorithms for Multimedia Servers
In this paper, we present two novel disk failure recovery methods that utilize the inherent characteristics of video streams for efficient recovery. Whereas the first method explo...
Prashant J. Shenoy, Harrick M. Vin
JPDC
2007
138views more  JPDC 2007»
13 years 7 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
SIGKDD
2008
125views more  SIGKDD 2008»
13 years 7 months ago
Incremental pattern discovery on streams, graphs and tensors
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
Jimeng Sun
IPPS
2006
IEEE
14 years 1 months ago
Design and analysis of a multi-dimensional data sampling service for large scale data analysis applications
Sampling is a widely used technique to increase efficiency in database and data mining applications operating on large dataset. In this paper we present a scalable sampling imple...
Xi Zhang, Tahsin M. Kurç, Joel H. Saltz, Sr...
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
12 years 11 months ago
SQPR: Stream query planning with reuse
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...
Evangelia Kalyvianaki, Wolfram Wiesemann, Quang Hi...