Sciweavers

2899 search results - page 293 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
CORR
2012
Springer
216views Education» more  CORR 2012»
14 years 2 months ago
Fractional Moments on Bandit Problems
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit proble...
Ananda Narayanan B., Balaraman Ravindran
ICIP
2002
IEEE
16 years 8 months ago
Error concealment using a diffusion based method
In this paper, we present a novel PDE based error concealment algorithm. We formulate the error concealment problem as a sequential optimization problem with both smoothing and or...
Hao Jiang, Cecilia Moloney
POPL
2006
ACM
16 years 7 months ago
Simplifying reductions
We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benc...
Gautam Gupta, Sanjay V. Rajopadhye
ICIP
2010
IEEE
15 years 4 months ago
Fast bilateral filtering by adapting block size
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
PODS
2006
ACM
107views Database» more  PODS 2006»
16 years 6 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar