Sciweavers

496 search results - page 25 / 100
» Machine models and lower bounds for query processing
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 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
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 2 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
CIDR
2003
106views Algorithms» more  CIDR 2003»
13 years 9 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
CCE
2006
13 years 7 months ago
Global optimization for the synthesis of integrated water systems in chemical processes
In this paper, we address the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are combined into a single net...
Ramkumar Karuppiah, Ignacio E. Grossmann
ICASSP
2011
IEEE
12 years 11 months ago
Performance bounds for tracking in a multipath environment
Tracking in a multipath environment poses many challenges. It is worth while to quantify the achievable performance bounds in such an environment. However finding the performance...
Bentarage Sachintha Karunaratne, Mark R. Morelande...