Sciweavers

288 search results - page 3 / 58
» Inclusion Problems for Patterns with a Bounded Number of Var...
Sort
View
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
13 years 10 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
CP
2009
Springer
14 years 5 months ago
A Constraint on the Number of Distinct Vectors with Application to Localization
Abstract. This paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables.The generalized constraint (called n...
Gilles Chabert, Luc Jaulin, Xavier Lorca
IJON
2007
134views more  IJON 2007»
13 years 4 months ago
Analysis of SVM regression bounds for variable ranking
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
Alain Rakotomamonjy
FCT
2001
Springer
13 years 9 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
JCO
2007
123views more  JCO 2007»
13 years 4 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...