Sciweavers

63 search results - page 10 / 13
» Strongly uniform bounds from semi-constructive proofs
Sort
View
TIT
2002
146views more  TIT 2002»
13 years 7 months ago
Least squares estimation of 2-D sinusoids in colored noise: Asymptotic analysis
This paper considers the problem of estimating the parameters of real-valued two-dimensional (2-D) sinusoidal signals observed in colored noise. This problem is a special case of t...
Guy Cohen, Joseph M. Francos
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 8 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
SPAA
2006
ACM
14 years 1 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
FOCS
2000
IEEE
13 years 12 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
ECCV
2004
Springer
14 years 9 months ago
Accuracy of Spherical Harmonic Approximations for Images of Lambertian Objects under Far and Near Lighting
Various problems in Computer Vision become difficult due to a strong influence of lighting on the images of an object. Recent work showed analytically that the set of all images of...
Darya Frolova, Denis Simakov, Ronen Basri