Sciweavers

876 search results - page 114 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
CIKM
2009
Springer
16 years 1 months ago
Privacy-enhanced public view for social graphs
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
Hyoungshick Kim, Joseph Bonneau
GRAPHITE
2004
ACM
15 years 12 months ago
A new fractal-based approach for 3D visualization of mountains in VRML standard
Several factors currently limit the size of Virtual Reality Modeling Language (VRML) models that can be effectively visualized over the Web. Main factors include network bandwidth...
Mohsen Sharifi, Fatemeh Hashemi Golpaygani, Mehdi ...
ANNPR
2006
Springer
15 years 10 months ago
Simple and Effective Connectionist Nonparametric Estimation of Probability Density Functions
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
Edmondo Trentin
CORR
2006
Springer
141views Education» more  CORR 2006»
15 years 6 months ago
Spectra of large block matrices
In a frequency selective slow-fading channel in a MIMO system, the channel matrix is of the form of a block matrix. This paper proposes a method to calculate the limit of the eige...
Reza Rashidi Far, Tamer Oraby, Wlodzimierz Bryc, R...
ECCV
2010
Springer
15 years 5 months ago
Hybrid Compressive Sampling via a New Total Variation TVL1
Compressive sampling (CS) is aimed at acquiring a signal or image from data which is deemed insufficient by Nyquist/Shannon sampling theorem. Its main idea is to recover a signal ...
Xianbiao Shu, Narendra Ahuja