244 search results - page 15 / 49 » Efficient Approximation Algorithms for Repairing Inconsisten... |
DATAMINE
2006
13 years 8 months ago
2006
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
FAW
2010
Springer
13 years 8 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
In many data sharing settings, such as within the biological and biomedical communities, global data consistency is not always attainable: different sites' data may be dirty,...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Bottom-up segmentation tends to rely on local features. Yet, many natural and man-made objects contain repeating elements. Such structural and more spread-out features are importa...