Sciweavers

1204 search results - page 189 / 241
» Termination of Polynomial Programs
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 9 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
64
Voted
CORR
2007
Springer
68views Education» more  CORR 2007»
14 years 9 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
PRL
2008
118views more  PRL 2008»
14 years 9 months ago
A large margin approach for writer independent online handwriting classification
This paper proposes a new approach for classifying multivariate time-series with applications to the problem of writer independent online handwritten character recognition. Each t...
Karthik Kumara, Rahul Agrawal, Chiranjib Bhattacha...
AIR
2005
122views more  AIR 2005»
14 years 9 months ago
The Genetic Kernel Support Vector Machine: Description and Evaluation
The Support Vector Machine (SVM) has emerged in recent years as a popular approach to the classification of data. One problem that faces the user of an SVM is how to choose a kerne...
Tom Howley, Michael G. Madden
TCS
2008
14 years 9 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon