Sciweavers

1806 search results - page 263 / 362
» Randomness and halting probabilities
Sort
View
148
Voted
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
14 years 4 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
14 years 3 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
263
Voted
ECCV
2008
Springer
17 years 3 months ago
Detecting Carried Objects in Short Video Sequences
We propose a new method for detecting objects such as bags carried by pedestrians depicted in short video sequences. In common with earlier work on the same problem, the method sta...
Dima Damen, David Hogg

Publication
189views
17 years 2 months ago
Packet Trains-Measurements and a New Model for Computer Network Traffic
Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival pr...
R. Jain, S. Routhier
CVPR
2009
IEEE
1695views Computer Vision» more  CVPR 2009»
16 years 11 months ago
Geometric min-Hashing: Finding a (Thick) Needle in a Haystack
We propose a novel hashing scheme for image retrieval, clustering and automatic object discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image featu...
Ondrej Chum (Czech Technical University), Michal P...