Sciweavers

5329 search results - page 235 / 1066
» The Weighted Majority Algorithm
Sort
View
ICANN
2007
Springer
16 years 21 days ago
Input Selection for Radial Basis Function Networks by Constrained Optimization
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Jarkko Tikka
MOBICOM
2000
ACM
15 years 11 months ago
Distributed fair scheduling in a wireless LAN
—Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weights of the packet flows ...
Nitin H. Vaidya, Paramvir Bahl, Seema Gupta
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
15 years 8 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
AUTOMATICA
2006
109views more  AUTOMATICA 2006»
15 years 6 months ago
Closed-loop subspace identification using the parity space
It is known that many subspace algorithms give biased estimates for closed-loop data due to the existence of feedback. In this paper we present a new subspace identification metho...
Jin Wang, S. Joe Qin
CSL
2007
Springer
15 years 6 months ago
Discriminative n-gram language modeling
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
Brian Roark, Murat Saraclar, Michael Collins