Sciweavers

227 search results - page 24 / 46
» A Competitive Algorithm for the General 2-Server Problem
Sort
View
ICML
2009
IEEE
16 years 3 months ago
A majorization-minimization algorithm for (multiple) hyperparameter learning
We present a general Bayesian framework for hyperparameter tuning in L2-regularized supervised learning models. Paradoxically, our algorithm works by first analytically integratin...
Chuan-Sheng Foo, Chuong B. Do, Andrew Y. Ng
INFOCOM
2010
IEEE
15 years 24 days ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 2 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
ATAL
2005
Springer
15 years 7 months ago
Negotiation mechanism for TAC SCM component market
This paper presents a new negotiation mechanism and a new supplier model for Trading Agent Competition Supply Chain Management(TAC SCM). Under the new negotiation mechanism, an ag...
Dongmo Zhang
TSP
2010
14 years 9 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer