Sciweavers

5153 search results - page 807 / 1031
» Introduction to Randomized Algorithms
Sort
View
CORR
2011
Springer
186views Education» more  CORR 2011»
14 years 10 months ago
Similarity Join Size Estimation using Locality Sensitive Hashing
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector similarity join size estimation (VSJ). It is a generali...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
101
Voted
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 10 months ago
Polynomial Estimators for High Frequency Moments
We present an algorithm for computing Fp, the pth moment of an n-dimensional frequency vector of a data stream, for p > 2, to within 1 ± factors, ∈ (0, 1] with high constant...
Sumit Ganguly
137
Voted
IJCV
2011
152views more  IJCV 2011»
14 years 10 months ago
Recovering Occlusion Boundaries from an Image
Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing str...
Derek Hoiem, Alexei A. Efros, Martial Hebert
156
Voted
CDC
2010
IEEE
123views Control Systems» more  CDC 2010»
14 years 10 months ago
Implicit learning for explicit discount targeting in Online Social networks
Online Social networks are increasingly being seen as a means of obtaining awareness of user preferences. Such awareness could be used to target goods and services at them. We cons...
Srinivas Shakkottai, Lei Ying, Sankalp Sah
135
Voted
IJNSEC
2010
143views more  IJNSEC 2010»
14 years 10 months ago
Nonce Generation For The Digital Signature Standard
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
Rajendra S. Katti, Rajesh G. Kavasseri