Sciweavers

5699 search results - page 342 / 1140
» Alternating model trees
Sort
View
INTERSPEECH
2010
15 years 2 months ago
Autoregressive clustering for HMM speech synthesis
The autoregressive HMM has been shown to provide efficient parameter estimation and high-quality synthesis, but in previous experiments decision trees derived from a non-autoregre...
Matt Shannon, William Byrne
CSFW
2012
IEEE
13 years 10 months ago
Information-Flow Security for a Core of JavaScript
—Tracking information flow in dynamic languages remains an important and intricate problem. This paper makes substantial headway toward understanding the main challenges and res...
Daniel Hedin, Andrei Sabelfeld
VLDB
2008
ACM
110views Database» more  VLDB 2008»
16 years 7 months ago
Enhancing histograms by tree-like bucket indices
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
Francesco Buccafurri, Gianluca Lax, Domenico Sacc...
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
ICML
2004
IEEE
16 years 1 months ago
Ensembles of nested dichotomies for multi-class problems
Nested dichotomies are a standard statistical technique for tackling certain polytomous classification problems with logistic regression. They can be represented as binary trees ...
Eibe Frank, Stefan Kramer