Sciweavers

2735 search results - page 451 / 547
» Comparing notions of randomness
Sort
View
119
Voted
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 10 days ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye
PAMI
2002
108views more  PAMI 2002»
15 years 9 days ago
Approximate Bayes Factors for Image Segmentation: The Pseudolikelihood Information Criterion (PLIC)
We propose a method for choosing the number of colors or true gray levels in an image; this allows fully automatic segmentation of images. Our underlying probability model is a hid...
Derek C. Stanford, Adrian E. Raftery
85
Voted
SIGIR
2002
ACM
15 years 9 days ago
Predicting query performance
We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resultin...
Stephen Cronen-Townsend, Yun Zhou, W. Bruce Croft
75
Voted
TIT
1998
70views more  TIT 1998»
15 years 9 days ago
Reduced-Redundancy Product Codes for Burst Error Correction
In a typical burst-error correction application of a product code of nv nh arrays, one uses an [nh; nh rh] code Ch that detects corrupted rows, and an [nv; nv rv] code Cv that is...
Ron M. Roth, Gadiel Seroussi
TMM
2002
104views more  TMM 2002»
15 years 9 days ago
Spatial contextual classification and prediction models for mining geospatial data
Modeling spatial context (e.g., autocorrelation) is a key challenge in classification problems that arise in geospatial domains. Markov random fields (MRF) is a popular model for i...
Shashi Shekhar, Paul R. Schrater, Ranga Raju Vatsa...