3874 search results - page 518 / 775 » Approximation Algorithms for k-hurdle Problems |
131
click to vote
ICMLA
2008
15 years 6 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
150
click to vote
AAAI
2004
15 years 6 months ago
2004
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
158
click to vote
WSCG
2004
15 years 6 months ago
2004
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
166
click to vote
NIPS
2000
15 years 6 months ago
2000
The human figure exhibits complex and rich dynamic behavior that is both nonlinear and time-varying. Effective models of human dynamics can be learned from motion capture data usi...
158
click to vote
ML
2002
ACM
15 years 4 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...