Sciweavers

78 search results - page 10 / 16
» Adaptive Methods for Linear Programming Decoding
Sort
View
HEURISTICS
2002
155views more  HEURISTICS 2002»
14 years 9 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
INFORMS
1998
100views more  INFORMS 1998»
14 years 9 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
JMM2
2008
228views more  JMM2 2008»
14 years 9 months ago
Adaptive AC-Coefficient Prediction for Image Compression and Blind Watermarking
In this work, an adaptive image compression algorithm is proposed based on the prediction of AC coefficients in Discrete Cosine Transform (DCT) block during reconstruction of image...
Kilari Veera Swamy, S. Srinivas Kumar
NIPS
2003
14 years 11 months ago
Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
Claudio Gentile
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
15 years 4 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point