2925 search results - page 51 / 585 » Information Complexity of Online Problems |
162
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
143
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
157
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
163
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
139
Voted
ICDE
2010
IEEE
16 years 25 days ago
2010
IEEE
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...