Sciweavers

2157 search results - page 428 / 432
» Learning Switching Concepts
Sort
View
IJCV
2006
299views more  IJCV 2006»
13 years 9 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
JMLR
2008
129views more  JMLR 2008»
13 years 9 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
IIE
2007
120views more  IIE 2007»
13 years 9 months ago
Words are Silver, Mouse-Clicks are Gold? (or how to optimize the level of language formalization of young students in a Logo-bas
How do we teach children to express and communicate ideas in a formal and informal mode? What type of language do they need in a concrete context? How should they determine a prope...
Evgenia Sendova, Toni Chehlarova, Pavel Boytchev
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 9 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
SAC
2006
ACM
13 years 9 months ago
Combining supervised and unsupervised monitoring for fault detection in distributed computing systems
Fast and accurate fault detection is becoming an essential component of management software for mission critical systems. A good fault detector makes possible to initiate repair a...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...