976 search results - page 83 / 196 » The Complexity of Timetable Construction Problems |
ICIP
2010
IEEE
13 years 7 months ago
2010
IEEE
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
TIT
2011
13 years 4 months ago
2011
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
ISW
2010
Springer
13 years 7 months ago
2010
Springer
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
AAAI
2010
13 years 10 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...