Sciweavers

483 search results - page 77 / 97
» Evaluating Top-k Selection Queries
Sort
View
ICCV
2003
IEEE
14 years 27 days ago
Active Concept Learning for Image Retrieval in Dynamic Databases
Concept learning in content-based image retrieval (CBIR) systems is a challenging task. This paper presents an active concept learning approach based on mixture model to deal with...
Anlei Dong, Bir Bhanu
ITCC
2003
IEEE
14 years 27 days ago
On the Mapping of Index Compression Techniques on CSR Information Retrieval
Information retrieval is the selection of documents relevant to a query. Inverted index is the conventional way to store the index of the collection. Because of the large amounts ...
Sterling Stuart Stein, Nazli Goharian
DAWAK
1999
Springer
13 years 12 months ago
Heuristic Algorithms for Designing a Data Warehouse with SPJ Views
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over relations that are stored in distributed heterogeneous databases. The selection of views for...
Spyros Ligoudistianos, Timos K. Sellis, Dimitri Th...
FC
2007
Springer
147views Cryptology» more  FC 2007»
13 years 11 months ago
Certificate Revocation Using Fine Grained Certificate Space Partitioning
A new certificate revocation system is presented. The basic idea is to divide the certificate space into several partitions, the number of partitions being dependent on the PKI en...
Vipul Goyal
AAAI
2010
13 years 9 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa