Sciweavers

33 search results - page 1 / 7
» The weight of competence under a realistic loss function
Sort
View
IGPL
2010
92views more  IGPL 2010»
13 years 3 months ago
The weight of competence under a realistic loss function
In many scientific, economic and policy-related problems, pieces of information from different sources have to be aggregated. Typically, the sources are not equally competent. T...
Stephan Hartmann, Jan Sprenger
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 5 months ago
Robust boosting and its relation to bagging
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
Saharon Rosset
TIT
2002
95views more  TIT 2002»
13 years 4 months ago
On sequential strategies for loss functions with memory
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Mar...
MASCOTS
2003
13 years 6 months ago
Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...
PE
2002
Springer
137views Optimization» more  PE 2002»
13 years 4 months ago
Analysis of two competing TCP/IP connections
Many mathematical models exist for describing the behavior of TCP/IP (TCP: transmission control protocol) under an exogenous loss process that does not depend on the window size. ...
Eitan Altman, Tania Jiménez, R. Nú&n...