(Enter summary)
Abstract: EXPLORING APPLICATIONS OF LEARNING THEORY TO PATTERN
MATCHING AND DYNAMIC ADJUSTMENT OF TCP ACKNOWLEDGMENT
DELAYS
by Stephen Donald Scott
ADVISOR: Associate Professor Sally A. Goldman
August, 1998
Saint Louis, Missouri
Learning theory is a subarea of machine learning that applies results from
theoretical computer science, including complexity theory and algorithm design and
analysis. In learning theory we rigorously study the efficiency and predictive performance
of learning algorithms.... (Update)
Context of citations to this paper: More
.... (Helmbold et al. 2000) and load balancing problems (Blum and Burch, 2000) as well as predicting TCP packet inter arrival times (Scott, 1998). Vovk (1997) developed a quasi probabilistic interpretation of the shifting expert algorithms by Herbster and Warmuth (1998a)...
Cited by: More
Tracking the Best Linear Predictor - Herbster (2001)
(Correct)
Similar documents (at the sentence level): More
34.9%: Dynamic Adjustment of TCP Acknowledgment Delays - In
(Correct)
15.5%: A Theoretical and Empirical Study of a Noise-Tolerant.. - Goldman, Scott (1996)
(Correct)
11.8%: Agnostic Learning of Geometric Patterns - Goldman, Kwek, Scott (1997)
(Correct)
Active bibliography (related documents): More All
0.9: Geometric Patterns: Algorithms and Applications - Scott (2000)
(Correct)
0.9: A Theoretical and Empirical Study of a Noise-Tolerant.. - Goldman, Scott (1996)
(Correct)
0.5: Learning One-Dimensional Geometric Patterns under One-Sided.. - Goldberg, Goldman (1994)
(Correct)
Similar documents based on text: More All
0.9: Design and Performance of Scalable High-Performance Programmable.. - Wolf (2002)
(Correct)
0.8: Techniques for Efficient and Scalable Video-on-Demand over.. - Janakiraman (2002)
(Correct)
0.7: Fuzzycast: Design and Implementation of a Scalable.. - Janakiraman (2002)
(Correct)
BibTeX entry: (Update)
S. D. Scott. Exploring Applications of Learning Theory to Pattern Matching and Dynamic Adjustment of TCP Acknowledgment Delays. PhD thesis, Washington University in St. Louis, August 1998. http://citeseer.ist.psu.edu/scott98exploring.html More
@misc{ scott98exploring,
author = "S. Scott",
title = "Exploring Applications of Learning Theory to Pattern Matching and Dynamic
Adjustment of TCP Acknowledgment Delays",
text = "S. D. Scott. Exploring Applications of Learning Theory to Pattern Matching
and Dynamic Adjustment of TCP Acknowledgment Delays. PhD thesis, Washington
University in St. Louis, August 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/scott98exploring.html" }
Citations (may not include all citations):
4212
Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1330
Congestion avoidance and control
- Jacobson - 1988
692
the self-similar nature of Ethernet traffic
- Leland, Taqqu et al. - 1994
624
Computer Networks (context) - Tanenbaum - 1996
610
Wide-area traffic: The failure of Poisson modeling
- Paxson, Floyd - 1995
493
Communications of the ACM (context) - Valiant, of et al. - 1984
488
Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
465
Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
454
the uniform convergence of relative frequencies of events to.. (context) - Vapnik, Chervonenkis - 1971
441
Queries and concept learning (context) - Angluin - 1988
317
Learning quickly when irrelevant attributes abound: A new li.. (context) - Littlestone - 1988
309
Requirements for Internet hosts---communication layers (context) - Braden - 1989
268
Decision theoretic generalizations of the PAC model for neur.. (context) - Haussler - 1992
261
The weighted majority algorithm
- Littlestone, Warmuth - 1994
248
An Introduction to Computational Learning Theory (context) - Kearns, Vazirani - 1994
234
Competitive snoopy caching (context) - Karlin, Manasse et al. - 1988
192
Measurements and Analysis of End-to-End Internet Dynamics
- Paxson - 1997
183
Solving multiclass learning problems via errorcorrecting out..
- Dietterich, Bakiri - 1995
151
A general lower bound on the number of examples needed for l.. (context) - Ehrenfeucht, Haussler et al. - 1989
149
Information Processing Letters (context) - Blumer, Ehrenfeucht et al. - 1987
144
Computational limitations on learning from examples (context) - Pitt, Valiant - 1988
133
Aggregating strategies (context) - Vovk - 1990
118
How to use expert advice (context) - Cesa-Bianchi, Freund et al.
111
Transmission control protocol: DARPA Internet program protoc.. (context) - Postel - 1981
109
Load-balancing heuristics and process behavior (context) - Leland, Ott - 1986
107
Efficient noise-tolerant learning from statistical queries
- Kearns - 1993
102
Toward efficient agnostic learning
- Kearns, Schapire et al. - 1994
92
Machine Learning: A Theoretical Approach (context) - Natarajan - 1991
90
An optimal online algorithm for metrical task systems (context) - Borodin, Linial et al. - 1992
84
Learning disjunctions of conjunctions (context) - Valiant - 1985
82
Error-correcting output coding corrects bias and variance
- Kong, Dietterich - 1995
81
Equivalence of models for polynomial learnability (context) - Haussler, Kearns et al. - 1991
79
Qualitative navigation for mobile robots (context) - Levitt, Lawton - 1990
79
Solving the multipleinstance problem with axis-parallel rect..
- Dietterich, Lathrop et al. - 1997
75
Competitive randomized algorithms for non-uniform problems (context) - Karlin, Manasse et al. - 1990
69
A dynamic disk spin-down technique for mobile computing
- Helmbold, Long et al. - 1996
68
Empirical support for winnow and weighted-majority algorithm..
- Blum - 1997
67
Bounding the Vapnik-Chervonenkis dimension of concept classe.. (context) - Goldberg, Jerrum - 1995
64
and linear threshold learning using Winnow (context) - Littlestone, attributes et al. - 1991
59
Improving performance in neural networks using a boosting al.. (context) - Drucker, Schapire et al. - 1992
59
Prediction preserving reducibility (context) - Pitt, Warmuth - 1990
54
Error-correcting output codes: A general method for improvin..
- Dietterich, Bakiri - 1991
49
functions on randomly drawn points (context) - Haussler, Littlestone et al. - 1994
43
Using and combining predictors that specialize
- Freund, Schapire et al. - 1997
37
Statistical queries and faulty PAC oracles
- Decatur - 1993
36
Efficient learning with virtual threshold gates
- Maass, Warmuth - 1998
33
General bounds on statistical query learning and PAC learnin..
- Aslam, Decatur - 1993
32
Cambridge Tracts in Theoretical Computer Science (context) - Anthony, Biggs et al. - 1992
32
From on-line to batch learning (context) - Littlestone - 1989
32
Applying winnow to context-sensitive spelling correction
- Golding, Roth - 1996
27
Tight worst-case loss bounds for predicting with expert advi..
- Haussler, Kivinen et al.
27
logarithmic mistake bounds when few input variables are rele.. (context) - Kivinen, Warmuth et al. - 1998
27
Using output codes to boost multiclass learning problems
- Schapire - 1997
25
Improving the performance of radial basis function networks ..
- Wettschereck, Dietterich - 1992
22
On learning from multi-instance examples: Empirical evaluati..
- Auer - 1997
19
Approximating hyper-rectangles: Learning and pseudo-random s..
- Auer, Long et al. - 1997
18
PAC learning axis-aligned rectangles with respect to product.. (context) - Long, Tan - 1996
17
Specification and simulation of statistical query algorithms..
- Aslam, Decatur - 1998
16
Approximation of convex bodies (context) - Gruber - 1983
12
Converting English text to speech: A machine learning approa.. (context) - Bakiri - 1991
12
Visual control of autonomous mobile robot based on self-orga.. (context) - Suzuki, Arimoto - 1988
12
Pareto distribution (context) - Arnold - 1985
11
Agnostic learning of geometric patterns
- Goldman, Kwek et al. - 1997
10
Internet Request for Comments (context) - Clark, acknowledgement et al. - 1982
9
Redesigning the BSD callout and timer facilities
- Costello, Varghese - 1995
9
Online bin packing with lookahead (context) - Grove - 1995
8
A theoretical and empirical study of a noisetolerant algorit..
- Goldman, Scott - 1998
8
Addision-Wesley Publishing Company (context) - Stevens, IP et al. - 1994
8
PAC Learning Geometrical Figures (context) - Goldberg - 1992
8
Addision-Wesley Publishing Company (context) - Wright, Stevens et al. - 1995
7
Image-Based Navigation Through Large-Scaled Environments (context) - Pinette - 1993
7
TCP dynamic acknowledgment delay: Theory and practice
- Dooly, Goldman et al. - 1998
7
International Cooperative Publishing House (context) - Arnold - 1983
7
IEEE Control Systems Magazine (context) - Hong, Tan et al. - 1992
6
Learning one-dimensional geometric patterns under one-sided ..
- Goldberg, Goldman - 1994
6
PAC learning of onedimensional patterns
- Goldberg, Goldman et al. - 1996
5
Learning to make rent-to-buy decisions with systems applicat..
- Krishnan, Long et al. - 1995
5
Competitive analysis of on-line disk scheduling
- Yeh, Kuo et al.
3
www-mash (context) - LBNL, ns - 1997
3
To appear in the Special Issue on Context Sensitivity and Co.. (context) - Auer, Warmuth et al. - 1998
3
Bayesian estimation and prediction for Pareto data (context) - Arnold, Press - 1989
2
Bayesian inference for Pareto populations (context) - Arnold, Press - 1983
2
To appear in the Special Issue on Context Sensitivity and Co.. (context) - Herbster, Warmuth et al. - 1998
Documents on the same site (http://www.cse.unl.edu/~sscott/research/abstracts/dsc-thesis-abs.shtml):
Dynamic Adjustment of TCP Acknowledgment Delays - In
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC