1007 search results - page 154 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
121
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
135
click to vote
AIPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we introduce real time image processing techniques using modern programmable Graphic Processing Units (GPU). GPUs are SIMD (Single Instruction, Multiple Data) device...
115
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
299
click to vote
PAMI
2010
15 years 24 days ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
136
Voted
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Recent advances in genotyping technology have led to the generation of an enormous quantity of genetic data. Traditional methods of statistical analysis have proved insufficient i...