Sciweavers

580 search results - page 38 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
116
Voted
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 3 months ago
Maintaining deforming surface meshes
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
Siu-Wing Cheng, Tamal K. Dey
ICML
2007
IEEE
16 years 3 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
ECSQARU
2007
Springer
15 years 8 months ago
Forward-Backward-Viterbi Procedures in the Transferable Belief Model for State Sequence Analysis Using Belief Functions
Abstract. The Transferable Belief Model (TBM) relies on belief functions and enables one to represent and combine a variety of knowledge from certain up to ignorance as well as con...
Emmanuel Ramasso, Michèle Rombaut, Denis Pe...
191
Voted
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
16 years 2 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
124
Voted
CISS
2008
IEEE
15 years 9 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...