Sciweavers

321 search results - page 31 / 65
» Modeling liaison in French by using decision trees
Sort
View
JAIR
2008
93views more  JAIR 2008»
13 years 8 months ago
Spectrum of Variable-Random Trees
In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
Fei Tony Liu, Kai Ming Ting, Yang Yu, Zhi-Hua Zhou
RTA
2010
Springer
14 years 12 days ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk
CEC
2010
IEEE
13 years 9 months ago
Learning-assisted evolutionary search for scalable function optimization: LEM(ID3)
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
Guleng Sheri, David Corne
CC
2010
Springer
282views System Software» more  CC 2010»
13 years 6 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
DSOM
2000
Springer
14 years 25 days ago
Operational Data Analysis: Improved Predictions Using Multi-computer Pattern Detection
Operational Data Analysis (ODA) automatically 1) monitors the performance of a computer through time, 2) stores such information in a data repository, 3) applies data-mining techn...
Ricardo Vilalta, Chidanand Apté, Sholom M. ...