930 citations
- Tel Aviv UniversityIL5 papers
- University of L'AquilaIT5 papers
- National Interuniversity Consortium for the Physical Sciences of MatterIT3 papers
- Brown UniversityUS2 papers
- California Institute of TechnologyUS2 papers
- Indiana UniversityUS2 papers
- Rutgers, The State University of New JerseyUS2 papers
- University of California SystemUS2 papers
- University of SzegedHU2 papers
- Aarhus UniversityDK1 paper
- Cornell UniversityUS1 paper
- Harvard UniversityUS1 paper
12 papers · 1 filter
Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction
F. Provost, G. M. Weiss
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the trai…
Automatically Training a Problematic Dialogue Predictor for a Spoken Dialogue System
A. Gorin, I. Langkilde-Geary, M. A. Walker +2
Spoken dialogue systems promise efficient and natural access to a large variety of information sources and services from any phone. However, current spoken dialogue systems are def…
ATTac-2000: An Adaptive Autonomous Bidding Agent
M. Kearns, M. L. Littman, S. Singh +1
The First Trading Agent Competition (TAC) was held from June 22nd to July 8th, 2000. TAC was designed to create a benchmark problem in the complex domain of e-marketplaces and to m…
Optimizing Dialogue Management with Reinforcement Learning: Experiments with the NJFun System
M. Kearns, D. Litman, S. Singh +1
Designing the dialogue policy of a spoken dialogue system involves many nontrivial choices. This paper presents a reinforcement learning approach for automatically optimizing a dia…
Orthogonal Range Searching on the RAM, Revisited
Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu
We present several new results on one of the most extensively studied topics in computational geometry, orthogonal range searching. All our results are in the standard word RAM mod…
Don't Rush into a Union: Take Time to Find Your Roots
Mihai Patrascu, Mikkel Thorup
We present a new threshold phenomenon in data structure lower bounds where slightly reduced update times lead to exploding query times. Consider incremental connectivity, letting t…