Sciweavers

11 search results - page 1 / 3
» Relative Expected Instantaneous Loss Bounds
Sort
View
COLT
2000
Springer
13 years 9 months ago
Relative Expected Instantaneous Loss Bounds
Jürgen Forster, Manfred K. Warmuth
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
13 years 11 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
ALT
2004
Springer
14 years 1 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
CDC
2010
IEEE
181views Control Systems» more  CDC 2010»
12 years 12 months ago
Relationship between power loss and network topology in power systems
This paper is concerned with studying how the minimum power loss in a power system is related to its network topology. The existing algorithms in the literature all exploit nonline...
Javad Lavaei, Steven H. Low
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...