12194 search results - page 208 / 2439 » cans 2010 |
136
click to vote
DKE
2010
15 years 4 months ago
2010
An ontology is a formal conceptualization of a domain, specifying the concepts of the domain and the relations between them. It is however not a straight forward task to use this ...
128
click to vote
ECCC
2010
15 years 4 months ago
2010
Locally decodable codes are error-correcting codes that admit efficient decoding algorithms; any bit of the original message can be recovered by looking at only a small number of ...
123
click to vote
ECCC
2010
15 years 4 months ago
2010
We define a combinatorial checkerboard to be a function f : {1, . . . , m}d {1, -1} of the form f(u1, . . . , ud) = d i=1 fi(ui) for some functions fi : {1, . . . , m} {1, -1}. T...
128
Voted
ECCC
2010
15 years 4 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
119
click to vote
ECCC
2010
15 years 4 months ago
2010
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...