2168 search results - page 218 / 434 » Randomized Algorithms and Complexity Theory |
145
Voted
TCOM
2010
15 years 2 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
97
Voted
ENTCS
2002
15 years 3 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
112
Voted
ICDT
2010
ACM
15 years 8 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
120
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
124
Voted
KAIS
2000
15 years 3 months ago
2000
When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Dat...