Sciweavers

4725 search results - page 434 / 945
» Dependence-Based Program Analysis
Sort
View
JMLR
2012
13 years 10 months ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...
JMLR
2012
13 years 10 months ago
Domain Adaptation: A Small Sample Statistical Approach
We study the prevalent problem when a test distribution differs from the training distribution. We consider a setting where our training set consists of a small number of sample d...
Ruslan Salakhutdinov, Sham M. Kakade, Dean P. Fost...
JMLR
2012
13 years 10 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
ICSE
2008
IEEE-ACM
16 years 8 months ago
Predicting defects using network analysis on dependency graphs
In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience bac...
Thomas Zimmermann, Nachiappan Nagappan
ICSE
2007
IEEE-ACM
16 years 7 months ago
Exception-Chain Analysis: Revealing Exception Handling Architecture in Java Server Applications
Although it is common in large Java programs to rethrow exceptions, existing exception-flow analyses find only single exceptionflow links, thus are unable to identify multiple-lin...
Chen Fu, Barbara G. Ryder