Sciweavers

750 search results - page 131 / 150
» Reconstruction for Models on Random Graphs
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 4 months ago
Trajectory Codes for Flash Memory
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
Anxiao Jiang, Michael Langberg, Moshe Schwartz, Je...
CVPR
2012
IEEE
11 years 9 months ago
Light field denoising, light field superresolution and stereo camera based refocussing using a GMM light field patch prior
With the recent availability of commercial light field cameras, we can foresee a future in which light field signals will be as common place as images. Hence, there is an immine...
Kaushik Mitra, Ashok Veeraraghavan
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 9 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
COLT
2007
Springer
14 years 1 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
PVLDB
2008
122views more  PVLDB 2008»
13 years 6 months ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor