412 search results - page 82 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
TASLP
2010
12 years 12 months ago
2010
This paper presents a framework for efficient HMM-based estimation of unreliable spectrographic speech data. It discusses the role of Hidden Markov Models (HMMs) during minimum mea...
VRCAI
2006
ACM
13 years 11 months ago
2006
ACM
Shadowing effects dramatically enhance the realism of virtual environments by providing useful visual cues. Shadow mapping is an efficient algorithm for real-time shadow renderin...
JMLR
2006
13 years 5 months ago
2006
In streamwise feature selection, new features are sequentially considered for addition to a predictive model. When the space of potential features is large, streamwise feature sel...
IROS
2009
IEEE
13 years 12 months ago
2009
IEEE
— Many critical elements for statically stable walking for legged robots have been known for a long time, including stability criteria based on support polygons, good foothold se...