Sciweavers

220 search results - page 40 / 44
» Distributed Minimum Cut Approximation
Sort
View
104
Voted
ICPR
2008
IEEE
15 years 6 months ago
Boosting Gaussian mixture models via discriminant analysis
The Gaussian mixture model (GMM) can approximate arbitrary probability distributions, which makes it a powerful tool for feature representation and classification. However, it su...
Hao Tang, Thomas S. Huang
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 1 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige
JCO
2006
234views more  JCO 2006»
15 years 9 days ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
TCOM
2011
155views more  TCOM 2011»
14 years 7 months ago
Asymptotically Optimal Model Estimation for Quantization
—Using high-rate theory approximations we introduce flexible practical quantizers based on possibly non-Gaussian models in both the constrained resolution (CR) and the constrain...
Alexey Ozerov, W. Bastiaan Kleijn
ICASSP
2011
IEEE
14 years 4 months ago
Spatially-correlated sensor discriminant analysis
A study of generalization error in signal detection by multiple spatially-distributed and -correlated sensors is provided when the detection rule is learned from a finite number ...
Kush R. Varshney