501 search results - page 32 / 101 » Rough Sets and Approximation Schemes |
118
Voted
UAI
2004
15 years 2 months ago
2004
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
103
Voted
IOR
2006
15 years 24 days ago
2006
For a discrete-time finite-state Markov chain, we develop an adaptive importance sampling scheme to estimate the expected total cost before hitting a set of terminal states. This s...
105
click to vote
DAC
1999
ACM
15 years 5 months ago
1999
ACM
Approximate reachability techniques trade o accuracy for the capacity to deal with bigger designs. Cho et al 4 proposed partitioning the set of state bits into mutually disjoint s...
116
Voted
SDM
2003
SIAM
15 years 2 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
91
Voted
VRST
1997
ACM
15 years 5 months ago
1997
ACM
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...