Sciweavers

258 search results - page 28 / 52
» Some Notes on Fine Computability
Sort
View
135
Voted
SOFSEM
2007
Springer
15 years 9 months ago
Incremental Learning of Planning Operators in Stochastic Domains
In this work we assume that there is an agent in an unknown environment (domain). This agent has some predefined actions and it can perceive its current state in the environment c...
Javad Safaei, Gholamreza Ghassem-Sani
130
Voted
ISCI
2000
92views more  ISCI 2000»
15 years 3 months ago
Quantum associative memory
This paper combines quantum computation with classical neural network theory to produce a quantum computational learning algorithm. Quantum computation uses microscopic quantum lev...
Dan Ventura, Tony R. Martinez
147
Voted
ICML
2002
IEEE
16 years 4 months ago
Syllables and other String Kernel Extensions
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...
Craig Saunders, Hauke Tschach, John Shawe-Taylor
151
Voted
ICCV
1998
IEEE
16 years 5 months ago
Ego-Motion and Omnidirectional Cameras
Recent research in image sensors has produced cameras with very large fields of view. A n area of computer vision research which will benefit from this technology is the computati...
Joshua Gluckman, Shree K. Nayar
121
Voted
TCS
1998
15 years 3 months ago
An Improved Zero-One Law for Algorithmically Random Sequences
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
Steven M. Kautz