Sciweavers

306 search results - page 52 / 62
» Underspecified computation of normal forms
Sort
View
IJAR
2006
98views more  IJAR 2006»
13 years 7 months ago
Inference in hybrid Bayesian networks with mixtures of truncated exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for solving hybrid Bayesian networks. Any probability density function can be approximated...
Barry R. Cobb, Prakash P. Shenoy
JSAT
2006
126views more  JSAT 2006»
13 years 7 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
NOMS
2010
IEEE
251views Communications» more  NOMS 2010»
13 years 6 months ago
Online detection of utility cloud anomalies using metric distributions
—The online detection of anomalies is a vital element of operations in data centers and in utility clouds like Amazon EC2. Given ever-increasing data center sizes coupled with th...
Chengwei Wang, Vanish Talwar, Karsten Schwan, Part...
MHCI
2009
Springer
14 years 3 days ago
Glancephone: an exploration of human expression
In this paper, we describe the design and ethnographic study of a phone developed so as to allow people to glance at each other, rather than simply message or voice call. Glanceph...
Richard H. R. Harper, Stuart Taylor
NIPS
2001
13 years 9 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio