Sciweavers

130 search results - page 15 / 26
» Algorithms for Finding a Most Similar Subforest
Sort
View
ICDE
2006
IEEE
154views Database» more  ICDE 2006»
15 years 3 months ago
Ontology-Driven Semantic Matches between Database Schemas
Schema matching has been historically difficult to automate. Most previous studies have tried to find matches by exploiting information on schema and data instances. However, sche...
Sangsoo Sung, Dennis McLeod
75
Voted
CMMR
2009
Springer
164views Music» more  CMMR 2009»
15 years 2 months ago
AllThatSounds: Associative Semantic Categorization of Audio Data
Finding appropriate and high-quality audio files for the creation of a sound track nowadays presents a serious hurdle to many media producers. As most digital sound archives rest...
Julian Rubisch, Matthias Husinsky, Hannes Raffased...
GIS
2009
ACM
15 years 10 months ago
On-Line Discovery of Flock Patterns in Spatio-Temporal Data
With the recent advancements and wide usage of location detection devices, large quantities of data are collected by GPS and cellular technologies in the form of trajectories. Whi...
Marcos R. Vieira, Petko Bakalov, Vassilis J. Tsotr...
CINQ
2004
Springer
163views Database» more  CINQ 2004»
15 years 2 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
GFKL
2006
Springer
78views Data Mining» more  GFKL 2006»
15 years 1 months ago
Putting Successor Variety Stemming to Work
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
Benno Stein, Martin Potthast