Sciweavers

218 search results - page 31 / 44
» Strong Bounds Consistencies and Their Application to Linear ...
Sort
View
ML
2008
ACM
162views Machine Learning» more  ML 2008»
13 years 8 months ago
Incorporating prior knowledge in support vector regression
This paper explores the addition of constraints to the linear programming formulation of the support vector regression problem for the incorporation of prior knowledge. Equality an...
Fabien Lauer, Gérard Bloch
RTSS
1997
IEEE
14 years 24 days ago
Exploiting skips in periodic tasks for enhancing aperiodic responsiveness
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For exampl...
Marco Caccamo, Giorgio C. Buttazzo
CVPR
2007
IEEE
14 years 10 months ago
Face Recognition using Discriminatively Trained Orthogonal Rank One Tensor Projections
We propose a method for face recognition based on a discriminative linear projection. In this formulation images are treated as tensors, rather than the more conventional vector o...
Gang Hua, Paul A. Viola, Steven M. Drucker
ACID
2006
236views Algorithms» more  ACID 2006»
13 years 10 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
ASIACRYPT
2006
Springer
14 years 10 days ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth