Sciweavers

1007 search results - page 179 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
CIKM
2008
Springer
15 years 1 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
MM
2009
ACM
177views Multimedia» more  MM 2009»
15 years 6 months ago
Transfer non-metric measures into metric for similarity search
Similarity search is widely used in multimedia retrieval systems to find the most similar ones for a given object. Some similarity measures, however, are not metric, leading to e...
Danzhou Liu, Kien A. Hua
PAKDD
2009
ACM
116views Data Mining» more  PAKDD 2009»
15 years 6 months ago
Scalable Web Mining with Newistic
Abstract. Newistic is a web mining platform that collects and analyses documents crawled from the Internet. Although it currently processes news articles, it can be easily adapted ...
Ovidiu Dan, Horatiu Mocian
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
15 years 1 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
DMDW
2000
93views Management» more  DMDW 2000»
15 years 1 months ago
Storing auxiliary data for efficient maintenance and lineage tracing of complex views
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
Yingwei Cui, Jennifer Widom