Sciweavers

7015 search results - page 1159 / 1403
» Approximation algorithms for co-clustering
Sort
View
ICALP
2009
Springer
16 years 4 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
16 years 4 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 4 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
PODS
2007
ACM
151views Database» more  PODS 2007»
16 years 4 months ago
Optimization of continuous queries with shared expensive filters
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When f...
Kamesh Munagala, Utkarsh Srivastava, Jennifer Wido...
138
Voted
EDBT
2004
ACM
121views Database» more  EDBT 2004»
16 years 4 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
« Prev « First page 1159 / 1403 Last » Next »