2912 search results - page 260 / 583 » Logistic Model Trees |
245
click to vote
CC
2010
Springer
15 years 5 months ago
2010
Springer
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...
214
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
140
click to vote
CLUSTER
2007
IEEE
16 years 29 days ago
2007
IEEE
— A new communication model, called the PlogPT model, is proposed to predict communication performance in a commodity cluster where computing nodes communicate using TCP/IP. This...
144
click to vote
EMNLP
2006
15 years 8 months ago
2006
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the pro...
180
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The Gaussian process latent variable model (GP-LVM) is a powerful approach for probabilistic modelling of high dimensional data through dimensional reduction. In this paper we ext...