Sciweavers

11484 search results - page 482 / 2297
» Modeling in the Large and Modeling in the Small
Sort
View
AAAI
1997
15 years 8 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
BMCBI
2010
129views more  BMCBI 2010»
15 years 7 months ago
Automatic prediction of catalytic residues by modeling residue structural neighborhood
Background: Prediction of catalytic residues is a major step in characterizing the function of enzymes. In its simpler formulation, the problem can be cast into a binary classific...
Elisa Cilia, Andrea Passerini
CG
2004
Springer
15 years 7 months ago
Occlusion Culling in OpenSG PLUS
Very large polygonal models are frequently used in scientific computing, mechanical engineering, or virtual medicine. An effective technique to handle these large models is occlus...
Dirk Staneker, Dirk Bartz, Wolfgang Straßer
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 8 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
CN
2004
122views more  CN 2004»
15 years 7 months ago
Group rekeying with limited unicast recovery
In secure group communications, a key server can deliver a "grouporiented" rekey message [22] to a large number of users efficiently using multicast. For reliable delive...
X. Brian Zhang, Simon S. Lam, Dong-Young Lee