Sciweavers

1578 search results - page 226 / 316
» Algorithmic randomness of continuous functions
Sort
View
CVPR
2007
IEEE
14 years 3 months ago
Optimized Color Sampling for Robust Matting
Image matting is the problem of determining for each pixel in an image whether it is foreground, background, or the mixing parameter, ”alpha”, for those pixels that are a mixt...
Jue Wang, Michael F. Cohen
INFOCOM
2006
IEEE
14 years 2 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
ICAPR
2005
Springer
14 years 2 months ago
Unsupervised Markovian Segmentation on Graphics Hardware
Abstract. This contribution shows how unsupervised Markovian segmentation techniques can be accelerated when implemented on graphics hardware equipped with a Graphics Processing Un...
Pierre-Marc Jodoin, Jean-François St-Amour,...
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 3 months ago
Polynomial Estimators for High Frequency Moments
We present an algorithm for computing Fp, the pth moment of an n-dimensional frequency vector of a data stream, for p > 2, to within 1 ± factors, ∈ (0, 1] with high constant...
Sumit Ganguly
TCC
2009
Springer
167views Cryptology» more  TCC 2009»
14 years 9 months ago
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan