Sciweavers

3204 search results - page 266 / 641
» Online Learning with Constraints
Sort
View
CP
2004
Springer
16 years 2 days ago
Decomposition and Learning for a Hard Real Time Task Allocation Problem
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Ma...
ICML
2005
IEEE
16 years 7 months ago
Building Sparse Large Margin Classifiers
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
Bernhard Schölkopf, Gökhan H. Bakir, Min...
INTERACT
1997
15 years 8 months ago
Teaching User Interface Design and Programming to Computer Science majors
This paper describes an innovative approach to teaching about human-computer interaction to a large class of students in their third year of a Computer Science major. Because of t...
Judy Kay, Bob Kummerfeld
JVCIR
2008
110views more  JVCIR 2008»
15 years 6 months ago
Video quality and system resources: Scheduling two opponents
In this article we present three key ideas which together form a flexible framework for maximizing user-perceived quality under given resources with modern video codecs (H.264). F...
Michael Roitzsch, Martin Pohlack
ICML
2007
IEEE
16 years 7 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern