Sciweavers

164 search results - page 22 / 33
» Maximally joining probabilistic data
Sort
View
INFOCOM
2003
IEEE
15 years 3 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly
DAGM
1998
Springer
15 years 1 months ago
Discrete Mixture Models for Unsupervised Image Segmentation
This paper introduces a novel statistical mixture model for probabilistic clustering of histogram data and, more generally, for the analysis of discrete co occurrence data. Adoptin...
Jan Puzicha, Joachim M. Buhmann, Thomas Hofmann
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
15 years 9 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...
INFOCOM
2003
IEEE
15 years 3 months ago
Pricing strategies under heterogeneous service requirements
— This paper analyzes a communication network with heterogeneous customers. We investigate priority queueing as a way to differentiate between these users. Customers join the net...
Michel Mandjes
93
Voted
ICML
2007
IEEE
15 years 10 months ago
Unsupervised estimation for noisy-channel models
Shannon's Noisy-Channel model, which describes how a corrupted message might be reconstructed, has been the corner stone for much work in statistical language and speech proc...
Markos Mylonakis, Khalil Sima'an, Rebecca Hwa