Sciweavers

1578 search results - page 221 / 316
» Algorithmic randomness of continuous functions
Sort
View
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 9 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 8 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
ICCV
2005
IEEE
14 years 10 months ago
Improved Sub-pixel Stereo Correspondences through Symmetric Refinement
Most dense stereo correspondence algorithms start by establishing discrete pixel matches and later refine these matches to sub-pixel precision. Traditional sub-pixel refinement me...
Diego Nehab, Szymon Rusinkiewicz, James Davis
ICIP
2003
IEEE
14 years 10 months ago
Removal of video line jitter using a dynamic programming approach
Analog video digitized from noisy sources can suffer of line registration problems due to bad synchronization pulses. The effect is that the image lines are randomly shiftedwith r...
Louis Laborelli
ICPR
2002
IEEE
14 years 10 months ago
Fractional Component Analysis (FCA) for Mixed Signals
This paper proposes the fractional component analysis (FCA), whose goal is to decompose the observed signal into component signals and recover their fractions. The uniqueness of o...
Asanobu Kitamoto