Sciweavers

354 search results - page 19 / 71
» Estimating random variables from random sparse observations
Sort
View
CIKM
2009
Springer
14 years 2 months ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu
COMPSEC
2004
131views more  COMPSEC 2004»
13 years 7 months ago
Biometric random number generators
Abstract Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random ...
Janusz Szczepanski, Elek Wajnryb, José M. A...
ALT
2011
Springer
12 years 7 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
CVPR
2011
IEEE
13 years 2 months ago
Illumination Estimation and Cast Shadow Detection through a Higher-order Graphical Model
In this paper, we propose a novel framework to jointly recover the illumination environment and an estimate of the cast shadows in a scene from a single image, given coarse 3D geo...
Alexandros Panagopoulos, Chaohui Wang, Dimitris Sa...
APPROX
2004
Springer
105views Algorithms» more  APPROX 2004»
14 years 27 days ago
Counting Connected Graphs and Hypergraphs via the Probabilistic Method
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwala...