Sciweavers

587 search results - page 22 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
COLT
2001
Springer
14 years 6 hour ago
Tracking a Small Set of Experts by Mixing Past Posteriors
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Olivier Bousquet, Manfred K. Warmuth
DCC
2000
IEEE
13 years 12 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
ICSE
2005
IEEE-ACM
14 years 7 months ago
Use of relative code churn measures to predict system defect density
Software systems evolve over time due to changes in requirements, optimization of code, fixes for security and reliability bugs etc. Code churn, which measures the changes made to...
Nachiappan Nagappan, Thomas Ball
BMCBI
2004
110views more  BMCBI 2004»
13 years 7 months ago
Tools for loading MEDLINE into a local relational database
Background: Researchers who use MEDLINE for text mining, information extraction, or natural language processing may benefit from having a copy of MEDLINE that they can manage loca...
Diane E. Oliver, Gaurav Bhalotia, Ariel S. Schwart...
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 11 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...