457 search results - page 72 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
ECCC
2011
13 years 2 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
Many natural images contain reflections and transparency, i.e., they contain mixtures of reflected and transmitted light. When viewed from a moving camera, these appear as the sup...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Asymptotically optimal bit allocation among a set of quantizers for a finite collection of sources was determined in 1963 by Huang and Schultheiss. Their solution, however, gives ...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...