2623 search results - page 380 / 525 » Universal Learning Theory |
171
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
136
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Finding informative genes from microarray data is an important research problem in bioinformatics research and applications. Most of the existing methods rank features according t...
157
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
166
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
166
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...