Sciweavers

316 search results - page 19 / 64
» On the Space Complexity of Randomized Synchronization
Sort
View
MVA
1990
123views Computer Vision» more  MVA 1990»
14 years 11 months ago
Randomized Hough Transform (RHT) in Engineering Drawing Vectorization System
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
Pekka Kultanen, Erkki Oja, Lei Xu
ESA
2007
Springer
121views Algorithms» more  ESA 2007»
15 years 4 months ago
Finding Frequent Elements in Non-bursty Streams
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...
Rina Panigrahy, Dilys Thomas
SIGGRAPH
1996
ACM
15 years 2 months ago
A Volumetric Method for Building Complex Models from Range Images
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: i...
Brian Curless, Marc Levoy
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 1 hour ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
JMLR
2010
109views more  JMLR 2010»
14 years 4 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...