16404 search results - page 2703 / 3281 » A set coverage problem |
205
click to vote
EUROCRYPT
2010
Springer
15 years 10 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
218
click to vote
HT
2009
ACM
15 years 10 months ago
2009
ACM
Adaptive hypermedia systems traditionally focus on providing personalised learning services for formal or informal learners. The learning material is typically sourced from a prop...
222
click to vote
AAAI
2007
15 years 9 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
233
click to vote
AAAI
2008
15 years 9 months ago
2008
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
190
click to vote
AAAI
2007
15 years 9 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...