Sciweavers

475 search results - page 30 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
14 years 7 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
PAA
2006
13 years 7 months ago
Efficient median based clustering and classification techniques for protein sequences
Abstract In this paper, an efficient K-medians clustering (unsupervised) algorithm for prototype selection and Supervised K-medians (SKM) classification technique for protein seque...
P. A. Vijaya, M. Narasimha Murty, D. K. Subramania...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 7 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
14 years 7 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...
ICIP
1998
IEEE
14 years 9 months ago
Video Content Representation using Optimal Extraction of Frames and Scenes
In this paper, an efficient video content representation is proposed using optimal extraction of characteristic frames and scenes. This representation, apart from providing browsi...
Nikolaos D. Doulamis, Anastasios D. Doulamis, Yann...