1640 search results - page 163 / 328 » Conditional Independence Trees |
114
click to vote
NIPS
2004
15 years 3 months ago
2004
Go is an ancient oriental game whose complexity has defeated attempts to automate it. We suggest using probability in a Bayesian sense to model the uncertainty arising from the va...
102
click to vote
UAI
2004
15 years 3 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
128
click to vote
WSCG
2004
15 years 3 months ago
2004
We present a lighting method for outdoor scenes with vegetation. The method is compatible with multiresolution trees generated using random L-systems. We include a sky dome model ...
106
click to vote
AAAI
1996
15 years 3 months ago
1996
This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M algorithm, a generalization of minimax ...
110
Voted
MVA
1994
15 years 3 months ago
1994
Several issues on automatic inspection of textile fabrics are discussed in this paper. To avoid the intense computation for real time inspection, we suggest a parallel pyramid har...