Sciweavers

872 search results - page 42 / 175
» Extreme lower probabilities
Sort
View
WSCG
2004
217views more  WSCG 2004»
15 years 1 months ago
Blending Textured Images Using a Non-parametric Multiscale MRF Method
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
Bernard Tiddeman
APIN
1998
78views more  APIN 1998»
15 years 6 days ago
The Method of Assigning Incidences
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...
Weiru Liu, David McBryan, Alan Bundy
88
Voted
TIT
2008
90views more  TIT 2008»
15 years 12 days ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason
125
Voted
CDC
2010
IEEE
111views Control Systems» more  CDC 2010»
14 years 7 months ago
Multi-robot monitoring in dynamic environments with guaranteed currency of observations
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...
Stephen L. Smith, Daniela Rus
MST
2011
205views Hardware» more  MST 2011»
14 years 7 months ago
Sublinear Time Algorithms for Earth Mover's Distance
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt ...