Sciweavers

1161 search results - page 28 / 233
» Approximation schemes for clustering problems
Sort
View
CVPR
2005
IEEE
15 years 11 months ago
A Bayesian Approach to Unsupervised Feature Selection and Density Estimation Using Expectation Propagation
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...
Shaorong Chang, Nilanjan Dasgupta, Lawrence Carin
74
Voted
CORR
2006
Springer
146views Education» more  CORR 2006»
14 years 9 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
CDC
2010
IEEE
104views Control Systems» more  CDC 2010»
14 years 4 months ago
Single timescale regularized stochastic approximation schemes for monotone Nash games under uncertainty
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...
Jayash Koshal, Angelia Nedic, Uday V. Shanbhag
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 4 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
IJCAI
1997
14 years 11 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter