Sciweavers

1974 search results - page 185 / 395
» On Unbiased Linear Approximations
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
AUTOMATICA
2008
93views more  AUTOMATICA 2008»
15 years 6 months ago
An LFT approach to parameter estimation
In this paper we consider a unified framework for parameter estimation problems which arise in a system identification context. In this framework, the parameters to be estimated a...
Kenneth Hsu, Tyrone L. Vincent, Greg Wolodkin, Sun...
MP
2008
135views more  MP 2008»
15 years 6 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
JCO
2000
116views more  JCO 2000»
15 years 6 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta
INFOCOM
2009
IEEE
16 years 1 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...