Sciweavers

3823 search results - page 213 / 765
» Experiments with Random Projection
Sort
View
160
Voted
WSC
1997
15 years 7 months ago
Descriptive Sampling: An Improvement over Latin Hypercube Sampling
Descriptive Sampling (DS), a Monte Carlo sampling technique based on a deterministic selection of the input values and their random permutation, represents a deep conceptual chang...
Eduardo Saliby
ICML
2010
IEEE
15 years 7 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
ICASSP
2010
IEEE
15 years 6 months ago
Concentration of measure for block diagonal measurement matrices
Concentration of measure inequalities are at the heart of much theoretical analysis of randomized compressive operators. Though commonly studied for dense matrices, in this paper ...
Michael B. Wakin, Jae Young Park, Han Lun Yap, Chr...
SCN
2008
Springer
142views Communications» more  SCN 2008»
15 years 6 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart
ICIP
2004
IEEE
16 years 7 months ago
Linear camera autocalibration with varying parameters
We provide a new technique for the Euclidean upgrading of a projective calibration for a set of ten or more cameras with known skew angle and aspect ratio and arbitrary varying fo...
Antonio Valdés, José Ignacio Ronda, ...