Sciweavers

2223 search results - page 360 / 445
» Ontological Framework for Approximation
Sort
View
EDBT
2004
ACM
187views Database» more  EDBT 2004»
16 years 1 months ago
Hierarchical In-Network Data Aggregation with Quality Guarantees
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
EDBT
2004
ACM
142views Database» more  EDBT 2004»
16 years 1 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
DCC
2003
IEEE
16 years 14 days ago
Linear Programming Optimization for Video Coding under Multiple Constraints
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
Yegnaswamy Sermadevi, Sheila S. Hemami
SDM
2009
SIAM
220views Data Mining» more  SDM 2009»
15 years 10 months ago
Bayesian Cluster Ensembles.
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...
Hongjun Wang, Hanhuai Shan, Arindam Banerjee
ALT
2006
Springer
15 years 9 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro