Sciweavers

1599 search results - page 304 / 320
» Theoretical Frameworks for Data Mining
Sort
View
ICDCS
1995
IEEE
13 years 11 months ago
Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach
One of the mostsoughtaftersoftware innovation of thisdecade is the construction of systems using off-the-shelf workstations that actually deliver, and even surpass, the power and ...
Partha Dasgupta, Zvi M. Kedem, Michael O. Rabin
AAAI
2008
13 years 10 months ago
Economic Hierarchical Q-Learning
Hierarchical state decompositions address the curse-ofdimensionality in Q-learning methods for reinforcement learning (RL) but can suffer from suboptimality. In addressing this, w...
Erik G. Schultink, Ruggiero Cavallo, David C. Park...
AIPS
2008
13 years 10 months ago
Bounded-Parameter Partially Observable Markov Decision Processes
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
Yaodong Ni, Zhi-Qiang Liu
DAS
2008
Springer
13 years 9 months ago
Difference of Boxes Filters Revisited: Shadow Suppression and Efficient Character Segmentation
A robust segmentation is the most important part of an automatic character recognition system (e.g. document processing, license plate recognition etc.). In our contribution we pr...
Erik Rodner, Herbert Süße, Wolfgang Ort...
NIPS
2008
13 years 9 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic