Sciweavers

1369 search results - page 50 / 274
» Lattice computations for random numbers
Sort
View
CSDA
2008
108views more  CSDA 2008»
13 years 9 months ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes
ICPR
2002
IEEE
14 years 10 months ago
Face Detection and Synthesis Using Markov Random Field Models
Markov Random Fields (MRFs) are proposed as viable stochastic models for the spatial distribution of gray level intensities for images of human faces. These models are trained usi...
Sarat C. Dass, Anil K. Jain, Xiaoguang Lu
CVPR
2011
IEEE
13 years 5 months ago
Identifying Players in Broadcast Sports Videos using Conditional Random Fields
We are interested in the problem of automatic tracking and identification of players in broadcast sport videos shot with a moving camera from a medium distance. While there are m...
Wei-Lwun Lu, Jo-Anne Ting, Kevin Murphy, Jim Littl...
SOFSEM
2012
Springer
12 years 4 months ago
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
Peter Damaschke, Azam Sheikh Muhammad
EJC
2010
13 years 9 months ago
The shape of unlabeled rooted random trees
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to th...
Michael Drmota, Bernhard Gittenberger