Sciweavers

5284 search results - page 436 / 1057
» Sampling search-engine results
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 2 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
KCAP
2009
ACM
16 years 2 months ago
Interactively shaping agents via human reinforcement: the TAMER framework
As computational learning agents move into domains that incur real costs (e.g., autonomous driving or financial investment), it will be necessary to learn good policies without n...
W. Bradley Knox, Peter Stone
FGR
2008
IEEE
299views Biometrics» more  FGR 2008»
16 years 2 months ago
Face recognition with occlusions in the training and testing sets
Partial occlusions in face images pose a great problem for most face recognition algorithms. Several solutions to this problem have been proposed over the years – ranging from d...
Hongjun Jia, Aleix M. Martínez
ICASSP
2008
IEEE
16 years 2 months ago
Compressed sensing with sequential observations
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of measurements. The results in the literature have focuse...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
ICPR
2008
IEEE
16 years 2 months ago
Online handwritten Bangla character recognition using HMM
We describe here a novel scheme for recognition of online handwritten basic characters of Bangla, an Indian script used by more than 200 million people. There are 50 basic charact...
Swapan K. Parui, Koushik Guin, Ujjwal Bhattacharya...