Sciweavers

191 search results - page 29 / 39
» Pattern-based decision tree construction
Sort
View
ICALP
1995
Springer
13 years 11 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
ESWA
2008
124views more  ESWA 2008»
13 years 7 months ago
A hybrid financial analysis model for business failure prediction
Accounting frauds have continuously happened all over the world. This leads to the need of predicting business failures. Statistical methods and machine learning techniques have b...
Shi-Ming Huang, Chih-Fong Tsai, David C. Yen, Yin-...
ICASSP
2011
IEEE
12 years 11 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, ...
LICS
2009
IEEE
14 years 2 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos
SAINT
2005
IEEE
14 years 1 months ago
HAR: Hierarchy-Based Anycast Routing Protocol for Wireless Sensor Networks
In this paper, we present Hierarchy-Based Anycast Routing (HAR), a routing protocol for collecting data over multi-hop, wireless sensor networks. The design of the protocol aims t...
Niwat Thepvilojanapong, Yoshito Tobe, Kaoru Sezaki