797 search results - page 6 / 160 » Observing Success in the Pi-Calculus |
125
Voted
TIT
2008
15 years 3 months ago
2008
Abstract--We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H0 : PXY against H1 : PXPY ...
115
click to vote
AAAI
1998
15 years 5 months ago
1998
Research in belief revision has been dominated by work that lies firmly within the classic AGM paradigm, characterized by a well-known set of postulates governing the behavior of ...
128
click to vote
ICRA
1995
IEEE
15 years 7 months ago
1995
IEEE
We introduce a technique for deiiecting moving objects from an image sequence obtained with a moving camera using the planarity constraint. To increase the robustness of this tech...
139
click to vote
ICRA
2002
IEEE
15 years 9 months ago
2002
IEEE
We apply the auxiliary particle filter algorithm of Pitt and Shephard (1999) to the problem of robot localization. To deal with the high-dimensional sensor observations (images) ...
129
click to vote
AIPS
2004
15 years 5 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...