Sciweavers

583 search results - page 57 / 117
» Efficient algorithms for constructing decision trees with co...
Sort
View
ESWA
2008
155views more  ESWA 2008»
14 years 9 months ago
Using GHSOM to construct legal maps for Taiwan's securities and futures markets
A good legal knowledge representation system, capable of effectively providing investors with comprehensive legal knowledge, is needed for investors to prevent erratic behavior be...
Jen-Ying Shih, Yu-Jung Chang, Wun-Hwa Chen
ICALP
1995
Springer
15 years 1 months ago
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Hans L. Bodlaender, Torben Hagerup
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
15 years 11 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...
BMCBI
2007
162views more  BMCBI 2007»
14 years 10 months ago
Three-Dimensional Phylogeny Explorer: Distinguishing paralogs, lateral transfer, and violation of "molecular clock" assumption w
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...
Namshin Kim, Christopher Lee
ICASSP
2011
IEEE
14 years 1 months ago
An optimization algorithm of independent mean and variance parameter tying structures for HMM-based speech synthesis
This paper proposes a technique for constructing independent parameter tying structures of mean and variance in HMMbased speech synthesis. Conventionally, mean and variance parame...
Shinji Takaki, Keiichiro Oura, Yoshihiko Nankaku, ...