Sciweavers

43264 search results - page 351 / 8653
» Comparing models of computation
Sort
View
160
Voted
JMLR
2012
13 years 7 months ago
A Stick-Breaking Likelihood for Categorical Data Analysis with Latent Gaussian Models
The development of accurate models and efficient algorithms for the analysis of multivariate categorical data are important and longstanding problems in machine learning and compu...
Mohammad Emtiyaz Khan, Shakir Mohamed, Benjamin M....
KES
2005
Springer
15 years 10 months ago
Enhancing Computer Chat: Toward a Smooth User-Computer Interaction
Abstract. Human-computer interaction (HCI) has fundamentally changed computing. The ubiquity of HCI can be seen in several kinds of application areas, such as text editing, hyperte...
Calkin A. S. Montero, Kenji Araki
137
Voted
AAAI
2007
15 years 7 months ago
Learning Graphical Model Structure Using L1-Regularization Paths
Sparsity-promoting L1-regularization has recently been succesfully used to learn the structure of undirected graphical models. In this paper, we apply this technique to learn the ...
Mark W. Schmidt, Alexandru Niculescu-Mizil, Kevin ...
CCR
2006
112views more  CCR 2006»
15 years 4 months ago
The probe gap model can underestimate the available bandwidth of multihop paths
The Probe Gap Model (PGM) was proposed as a lightweight and fast available bandwidth estimation method. Measurement tools such as Delphi and Spruce are based on PGM. Compared to e...
Li Lao, Constantine Dovrolis, M. Y. Sanadidi
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 3 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale