Sciweavers

2354 search results - page 345 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ECCV
2004
Springer
16 years 8 months ago
MCMC-Based Multiview Reconstruction of Piecewise Smooth Subdivision Curves with a Variable Number of Control Points
We investigate the automated reconstruction of piecewise smooth 3D curves, using subdivision curves as a simple but flexible curve representation. This representation allows taggin...
Michael Kaess, Rafal Zboinski, Frank Dellaert
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 7 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
DAC
1998
ACM
16 years 7 months ago
Phase Noise in Oscillators: A Unifying Theory and Numerical Methods for Characterisation
Phase noise is a topic of theoretical and practical interest in electronic circuits, as well as in other fields such as optics. Although progress has been made in understanding th...
Alper Demir, Amit Mehrotra, Jaijeet S. Roychowdhur...
ICML
2008
IEEE
16 years 6 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 6 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai