1511 search results - page 98 / 303 » Randomness, lowness and degrees |
172
click to vote
ECCV
2000
Springer
16 years 8 months ago
2000
Springer
A new probabilistic background model based on a Hidden Markov Model is presented. The hidden states of the model enable discrimination between foreground, background and shadow. Th...
159
click to vote
SIGECOM
2009
ACM
16 years 24 days ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
145
click to vote
JSAC
2007
15 years 6 months ago
2007
Abstract—Provisioning random access functions in peer-topeer on-demand video streaming is challenging, due to not only the asynchronous user interactivity but also the unpredicta...
141
click to vote
TIT
2008
15 years 6 months ago
2008
A popular way to measure the degree of dependence between two random objects is by their mutual information, defined as the divergence between the joint and product-of-marginal dis...
165
click to vote
TCS
2002
15 years 6 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...