Sciweavers

3875 search results - page 470 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
WSC
2008
15 years 9 months ago
On step sizes, stochastic shortest paths, and survival probabilities in Reinforcement Learning
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
Abhijit Gosavi
WWW
2007
ACM
16 years 7 months ago
Efficient search engine measurements
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
Ziv Bar-Yossef, Maxim Gurevich
ACM
1995
15 years 10 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak
PPSC
1997
15 years 8 months ago
The Future Fast Fourier Transform?
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
Alan Edelman, Peter McCorquodale, Sivan Toledo
ECCV
2010
Springer
16 years 1 days ago
Energy Minimization Under Constraints on Label Counts
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...