Sciweavers

5595 search results - page 984 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
149
Voted
NN
2002
Springer
136views Neural Networks» more  NN 2002»
15 years 4 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 4 months ago
Structure-Aware Stochastic Control for Transmission Scheduling
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
Fangwen Fu, Mihaela van der Schaar
INFOCOM
2010
IEEE
15 years 3 months ago
Optimal Probing for Unicast Network Delay Tomography
—Network tomography has been proposed to ascertain internal network performances from end-to-end measurements. In this work, we present priority probing, an optimal probing schem...
Yu Gu, Guofei Jiang, Vishal Singh, Yueping Zhang
148
Voted
TCOM
2010
133views more  TCOM 2010»
15 years 3 months ago
Transmission control in cognitive radio as a Markovian dynamic game: Structural result on randomized threshold policies
Abstract——This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...
J. Huang, V. Krishnamurthy
ICDM
2010
IEEE
150views Data Mining» more  ICDM 2010»
15 years 3 months ago
Probabilistic Inference Protection on Anonymized Data
Background knowledge is an important factor in privacy preserving data publishing. Probabilistic distributionbased background knowledge is a powerful kind of background knowledge w...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, Y...