Results 211 to 220 of about 634,856 (265)

Non-Binary Matroids Having At Most Three Non-Binary Elements

Combinatorics, Probability and Computing, 1994
An element e of a matroid M is called non-binary when M\e and M/e are both non-binary matroids. Oxley in [5] gave a characterization of the 3-connected non-binary matroids without non-binary elements. In this paper, we will construct all the 3-connected matroids having 1, 2 or 3 non-binary elements.
openaire   +2 more sources

Distributed Non-binary Constraints

2004
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constraints. Hard constraints must hold while soft constraints may be violated but as many as possible should be satisfied. Although the problem constraints can be divided into two
Miguel A. Salido, Federico Barber
openaire   +1 more source

Non-binary classification trees

Statistics and Computing, 1996
The main objective of this paper is to implement non-binary splits into Gelfand et al.'s modification of the CART algorithm. Multi-way splits can sometimes better reflect the structure of data than binary splits. Methods for the construction and comparison of such splits are described.
openaire   +1 more source

On minors of non-binary matroids

Combinatorica, 1981
No binary matroid has a minor isomorphic toU42, the “four-point line”, and Tutte showed that, conversely, every non-binary matroid has aU42 minor. However, more can be said about the element sets ofU42 minors and their distribution. Bixby characterized those elements which are inU42 minors; a matroidM has aU42 minor using elementx if and only if the ...
openaire   +1 more source

Non-binary Constraints

1999
Since the origins of the constraint satisfaction paradigm, its restriction to binary constraints has concentrated a significant part of the work. This is understandable because new ideas/techniques are usually much simpler to present/ elaborate by first restricting them to the binary case.
openaire   +1 more source

Non-binary Evaluation for Schema Matching

2012
In this work we extend the commonly used binary evaluation of schema matching to support evaluation methods for non-binary matching results as well. We motivate our work with some new applications of schema matching. Non-binary evaluation is formally defined together with two new, non-binary evaluation measures using a vector-space representation of ...
Tomer Sagi, Avigdor Gal
openaire   +1 more source

Non-Binary Error Correction Codes*

Bell System Technical Journal, 1957
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Non-binary matroids having four non-binary elements

Ars Comb., 1997
The 3-connected matroids with exactly four non-binary elements are described (an element \(e\) of a matroid \(M\) is non-binary if neither \(M/e\) nor \(M\setminus e\) are binary matroids). There are two infinite classes and three more specific matroids. Previously, \textit{James G. Oxley} [J. Comb. Theory, Ser.
openaire   +1 more source

Reformulation of Non-binary Constraints

2002
Constraint satisfaction problems (CSPs) frequently emerge in practical situations. Unfortunately these problems are likely to be computationally intractable. In practice, it is necessary to implement strategies that reduce the amount of computational effort expended in finding solutions to CSPs.
openaire   +1 more source

Associated Constraint Based Non-Binary Arc Consistency for Non-Binary CSP

2007 International Conference on Wireless Communications, Networking and Mobile Computing, 2007
Arc consistency has been successfully applied to binary constraint satisfaction problem but cannot be generalized to effectively preprocess non-binary constraint satisfaction problem (NCSP). Associated constraint based non-binary arc consistency (nACBA) for preprocessing NCSP was proposed in this paper.
Kexi Wang, Jijun Yuan, Miyuan Shan
openaire   +1 more source