Sciweavers

311 search results - page 37 / 63
» Better streaming algorithms for clustering problems
Sort
View
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
12 years 1 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
COCOA
2008
Springer
14 years 19 days ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
TIP
2011
116views more  TIP 2011»
13 years 5 months ago
Interactive Streaming of Stored Multiview Video Using Redundant Frame Structures
—While much of multiview video coding focuses on the rate-distortion performance of compressing all frames of all views for storage or non-interactive video delivery over network...
Gene Cheung, Antonio Ortega, Ngai-Man Cheung
HPCC
2007
Springer
14 years 5 months ago
Parallel Genetic Algorithms for DVS Scheduling of Distributed Embedded Systems
Many of today’s embedded systems, such as wireless and portable devices rely heavily on the limited power supply. Therefore, energy efficiency becomes one of the major design con...
Man Lin, Chen Ding
HIPC
2009
Springer
13 years 8 months ago
Highly scalable algorithm for distributed real-time text indexing
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
Ankur Narang, Vikas Agarwal, Monu Kedia, Vijay K. ...