1887 search results - page 25 / 378 » An efficient search algorithm for partially ordered sets |
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
IJCM
2002
13 years 7 months ago
2002
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
DMIN
2006
13 years 9 months ago
2006
Association rule mining techniques are used to search attribute-value pairs that occur frequently together in a data set. Ordinal association rules are a particular type of associa...
EMMCVPR
2009
Springer
13 years 5 months ago
2009
Springer
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...