Sciweavers

1768 search results - page 8 / 354
» Mining Very Large Databases
Sort
View
WIDM
2009
ACM
14 years 4 months ago
Distinct nearest neighbors queries for similarity search in very large multimedia databases
As the volume of multimedia data available on internet is tremendously increasing, the content-based similarity search becomes a popular approach to multimedia retrieval. The most...
Tomás Skopal, Vlastislav Dohnal, Michal Bat...
COLING
2008
13 years 11 months ago
A Linguistic Knowledge Discovery Tool: Very Large Ngram Database Search with Arbitrary Wildcards
In this paper, we will describe a search tool for a huge set of ngrams. The tool supports queries with an arbitrary number of wildcards. It takes a fraction of a second for a sear...
Satoshi Sekine
MTA
2006
173views more  MTA 2006»
13 years 9 months ago
Active learning in very large databases
Abstract. Query-by-example and query-by-keyword both suffer from the problem of "aliasing," meaning that example-images and keywords potentially have variable interpretat...
Navneet Panda, Kingshy Goh, Edward Y. Chang
ISMIR
2004
Springer
87views Music» more  ISMIR 2004»
14 years 3 months ago
Search Effectiveness Measures for Symbolic Music Queries in Very Large Databases
In the interest of establishing robust benchmarks for search efficiency, we conducted a series of tests on symbolic databases of musical incipits and themes taken from several di...
Craig Stuart Sapp, Yi-Wen Liu, Eleanor Selfridge-F...
CIKM
2010
Springer
13 years 8 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil