Sciweavers

342 search results - page 44 / 69
» Using Decision Trees to Construct a Practical Parser
Sort
View
SPAA
1997
ACM
14 years 25 days ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
COMSIS
2010
13 years 6 months ago
A novel hierarchical speech emotion recognition method based on improved DDAGSVM
In order to improve the recognition accuracy of speech emotion recognition, in this paper, a novel hierarchical method based on improved Decision Directed Acyclic Graph SVM (improv...
Qi-Rong Mao, Yong-Zhao Zhan
KDD
2007
ACM
566views Data Mining» more  KDD 2007»
14 years 9 months ago
IMDS: intelligent malware detection system
The proliferation of malware has presented a serious threat to the security of computer systems. Traditional signature-based antivirus systems fail to detect polymorphic and new, ...
Yanfang Ye, Dingding Wang, Tao Li, Dongyi Ye
LREC
2008
180views Education» more  LREC 2008»
13 years 10 months ago
Do we Still Need Gold Standards for Evaluation?
The availability of a huge mass of textual data in electronic format has increased the need for fast and accurate techniques for textual data processing. Machine learning and stat...
Thierry Poibeau, Cédric Messiant
ICALP
1995
Springer
14 years 6 days 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