Sciweavers

43 search results - page 2 / 9
» Empirical Bernstein stopping
Sort
View
ICML
2009
IEEE
14 years 6 months ago
Learning when to stop thinking and do something!
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
Barnabás Póczos, Csaba Szepesv&aacut...
ECAI
2010
Springer
13 years 6 months ago
Egalitarian Utilities Divide-and-Coordinate: Stop arguing about decisions, let's share rewards!
Abstract. In this paper we formulate a novel Divide-andCoordinate (DaC) algorithm, the so-called Egalitarian Utilities Divide-and-Coordinate (EU-DaC) algorithm. The Divide-andCoord...
Meritxell Vinyals, Juan A. Rodríguez-Aguila...
SCAM
2006
IEEE
13 years 11 months ago
Stop-List Slicing
Traditional program slicing requires two parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the...
Keith Gallagher, David Binkley, Mark Harman

Publication
210views
15 years 3 months ago
Using GIS to Measure the Effect of Overlapping Service Areas on Passenger Boardings at Bus Stops
This study examines the effects of overlapping walking service areas of bus stops on the demand for bus transit. This requires controlling for variation in potential transit demand...
T. J. Kimpel, K. Dueker, A. M. El-Geneidy
FOIKS
2008
Springer
14 years 2 months ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn