Sciweavers

3820 search results - page 513 / 764
» Bounded Model Debugging
Sort
View
124
Voted
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 3 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
CORR
2010
Springer
88views Education» more  CORR 2010»
15 years 3 months ago
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
Jop Briët, Fernando Mário de Oliveira ...
DAM
2010
81views more  DAM 2010»
15 years 3 months ago
Parallel cleaning of a network with brushes
We consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edg...
Serge Gaspers, Margaret-Ellen Messinger, Richard J...
DEDS
2010
88views more  DEDS 2010»
15 years 3 months ago
On the Performance Evaluation of Multi-Guarded Marked Graphs with Single-Server Semantics
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
Jorge Júlvez, Jordi Cortadella, Michael Kis...
DISOPT
2008
85views more  DISOPT 2008»
15 years 3 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci