Sciweavers

173 search results - page 17 / 35
» An optimal randomized algorithm for maximum Tukey depth
Sort
View
ICCV
2001
IEEE
14 years 9 months ago
Markov Face Models
The spatial distribution of gray level intensities in an image can be naturally modeled using Markov Random Field (MRF) models. We develop and investigate the performance of face ...
Sarat C. Dass, Anil K. Jain
PR
2002
108views more  PR 2002»
13 years 7 months ago
Hyperparameter estimation for satellite image restoration using a MCMC maximum-likelihood method
The satellite image deconvolution problem is ill-posed and must be regularized. Herein, we use an edge-preserving regularization model using a ' function, involving two hyper...
André Jalobeanu, Laure Blanc-Féraud,...
TSMC
1998
78views more  TSMC 1998»
13 years 7 months ago
Automata learning and intelligent tertiary searching for stochastic point location
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
B. John Oommen, Govindachari Raghunath
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
14 years 1 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu