Sciweavers

1578 search results - page 42 / 316
» Algorithmic randomness of continuous functions
Sort
View
ICPR
2008
IEEE
14 years 5 months ago
Optimal feature weighting for the continuous HMM
We propose new Continuous Hidden Markov Model (CHMM) structure that integrates feature weighting component. We assume that each feature vector could include different subsets of f...
Oualid Missaoui, Hichem Frigui
HICSS
2005
IEEE
146views Biometrics» more  HICSS 2005»
14 years 4 months ago
Maintaining Continuous Dependability in Sensor-Based Context-Aware Pervasive Computing Systems
Sensors are often indicative of events of interest, or events which a system should be aware of and should react to. In particular, such indications may reflect unsteadiness or in...
Amir Padovitz, Arkady B. Zaslavsky, Seng Wai Loke,...
NIPS
2003
14 years 10 days ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
NIPS
1998
14 years 10 days ago
A Polygonal Line Algorithm for Constructing Principal Curves
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
Balázs Kégl, Adam Krzyzak, Tam&aacut...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 5 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day