Sciweavers

2382 search results - page 37 / 477
» Generating Seeded Trees from Data Sets
Sort
View
FOCS
2009
IEEE
15 years 6 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
CIKM
2008
Springer
15 years 1 months ago
Efficient frequent pattern mining over data streams
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
RE
2005
Springer
15 years 5 months ago
Using Occurrence Properties of Defect Report Data to Improve Requirements
Defect reports generated for faults found during testing provide a rich source of information regarding problematic phrases used in requirements documents. These reports indicate ...
Kimberly S. Wasson, Kendra N. Schmid, Robyn R. Lut...
80
Voted
ISMIR
2004
Springer
124views Music» more  ISMIR 2004»
15 years 5 months ago
Eigenrhythms: Drum pattern basis sets for classification and generation
We took a collection of 100 drum beats from popular music tracks and estimated the measure length and downbeat position of each one. Using these values, we normalized each pattern...
Dan Ellis, John Arroyo
LICS
2002
IEEE
15 years 4 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin