Sciweavers

6110 search results - page 443 / 1222
» Approximate Computing
Sort
View
NIPS
1996
15 years 8 months ago
Hidden Markov Decision Trees
We study a time series model that can be viewed as a decision tree with Markov temporal structure. The model is intractable for exact calculations, thus we utilize variational app...
Michael I. Jordan, Zoubin Ghahramani, Lawrence K. ...
UAI
1996
15 years 8 months ago
Asymptotic Model Selection for Directed Networks with Hidden Variables
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
Dan Geiger, David Heckerman, Christopher Meek
TREC
2007
15 years 8 months ago
Relaxed Online SVMs in the TREC Spam Filtering Track
Relaxed Online Support Vector Machines (ROSVMs) have recently been proposed as an efficient methodology for attaining an approximate SVM solution for streaming data such as the on...
David Sculley, Gabriel Wachman
ICML
2010
IEEE
15 years 7 months ago
A DC Programming Approach for Sparse Eigenvalue Problem
We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...
Mamadou Thiao, Pham Dinh Tao, Le Thi Hoai An
COR
2008
112views more  COR 2008»
15 years 7 months ago
Buffer allocation in general single-server queueing networks
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
Frederico R. B. Cruz, A. R. Duarte, Tom Van Woense...