Sciweavers

4536 search results - page 208 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
DAGSTUHL
2006
13 years 11 months ago
Point-set algorithms for pattern discovery and pattern matching in music
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
David Meredith
ISDA
2008
IEEE
14 years 4 months ago
Compute the Term Contributed Frequency
In this paper, we propose an algorithm and data structure for computing the term contributed frequency (tcf) for all N-grams in a text corpus. Although term frequency is one of th...
Cheng-Lung Sung, Hsu-Chun Yen, Wen-Lian Hsu
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
14 years 3 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
AUSAI
2006
Springer
14 years 1 months ago
Learning Hybrid Bayesian Networks by MML
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
Rodney T. O'Donnell, Lloyd Allison, Kevin B. Korb
PODS
1997
ACM
182views Database» more  PODS 1997»
14 years 1 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...