1640 search results - page 90 / 328 » Conditional Independence Trees |
168
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
181
click to vote
SADM
2011
15 years 1 months ago
2011
Abstract: Visualizing data by graphing a response against certain factors, and conditioning on other factors, has arisen independently in many contexts. One is the interaction plot...
151
click to vote
NIPS
2003
15 years 7 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
170
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
163
click to vote
ICASSP
2009
IEEE
16 years 28 days ago
2009
IEEE
This work presents a class of unidirectional lifting-based wavelet transforms for an arbitrary communication graph in a wireless sensor network. These transforms are unidirectiona...