Sciweavers

176 search results - page 14 / 36
» On the analysis of queries with counting constraints
Sort
View
ISMIR
2005
Springer
179views Music» more  ISMIR 2005»
14 years 2 months ago
Discovering and Visualizing Prototypical Artists by Web-Based Co-Occurrence Analysis
Detecting artists that can be considered as prototypes for particular genres or styles of music is an interesting task. In this paper, we present an approach that ranks artists ac...
Markus Schedl, Peter Knees, Gerhard Widmer
TCS
2008
13 years 8 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 8 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 6 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
CIKM
2004
Springer
14 years 2 months ago
Processing content-oriented XPath queries
Document-centric XML collections contain text-rich documents, marked up with XML tags that add lightweight semantics to the text. Querying such collections calls for a hybrid quer...
Börkur Sigurbjörnsson, Jaap Kamps, Maart...