1561 search results - page 135 / 313 » Probability Theory on IF Events |
145
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
This article presents a preceding car rear view tracking algorithm which utilizes a particle filter and belief function data fusion. Most of tracking applications resort to only o...
193
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
164
click to vote
FCT
2007
Springer
16 years 1 months ago
2007
Springer
We propose and study a new information transmission problem motivated by today’s internet. A real number, perhaps representing control information in a network, is encoded using...
182
click to vote
SPAA
2005
ACM
16 years 13 days ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
163
click to vote
FOSSACS
2004
Springer
16 years 8 days ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...