Sciweavers

11949 search results - page 255 / 2390
» Some results on (a:b)-choosability
Sort
View
PVLDB
2008
126views more  PVLDB 2008»
15 years 1 months ago
Dwarfs in the rearview mirror: how big are they really?
Online-Analytical Processing (OLAP) has been a field of competing technologies for the past ten years. One of the still unsolved challenges of OLAP is how to provide quick respons...
Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz ...
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 8 months ago
Robust Matrix Completion with Corrupted Columns
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
Yudong Chen, Huan Xu, Constantine Caramanis, Sujay...
ECCC
2011
183views ECommerce» more  ECCC 2011»
14 years 8 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
WWW
2005
ACM
16 years 2 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
EUROCRYPT
2008
Springer
15 years 3 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai