Sciweavers

1578 search results - page 84 / 316
» Algorithmic randomness of continuous functions
Sort
View
DAMON
2008
Springer
14 years 11 months ago
Fast scans and joins using flash drives
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...
Mehul A. Shah, Stavros Harizopoulos, Janet L. Wien...
TOMACS
2010
79views more  TOMACS 2010»
14 years 4 months ago
A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
Sumit Kunnumkal, Huseyin Topaloglu
ICIAP
2007
ACM
15 years 10 months ago
A High Performance Exact Histogram Specification Algorithm
Real-time histogram specification methods aims to find a continuous function that transforms a source image to match a target distribution with the highest possible degree of accu...
Alessandro Bevilacqua, Pietro Azzari
ALT
2008
Springer
15 years 6 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
JCB
2006
215views more  JCB 2006»
14 years 9 months ago
Protein Fold Recognition Using Segmentation Conditional Random Fields (SCRFs)
Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e., segmentation con...
Yan Liu 0002, Jaime G. Carbonell, Peter Weigele, V...