Sciweavers

2131 search results - page 310 / 427
» A computational approximation to the AIXI model
Sort
View
EUROCRYPT
2004
Springer
15 years 9 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
WSC
2004
15 years 7 months ago
A Large Deviations Perspective on Ordinal Optimization
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
Peter W. Glynn, Sandeep Juneja
AMC
2006
114views more  AMC 2006»
15 years 6 months ago
A multi-objective resource allocation problem in dynamic PERT networks
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...
Amir Azaron, Reza Tavakkoli-Moghaddam
CGF
2007
113views more  CGF 2007»
15 years 6 months ago
Real-time homogenous translucent material editing
This paper presents a novel method for real-time homogenous translucent material editing under fixed illumination. We consider the complete analytic BSSRDF model proposed by Jens...
Kun Xu, Yue Gao, Yong Li, Tao Ju, Shi-Min Hu
TSP
2008
151views more  TSP 2008»
15 years 5 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...