9842 search results - page 267 / 1969 » The Complexity of the Matching-Cut Problem |
156
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
126
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
138
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
115
click to vote
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
High frequency digital LSIs usually consist of many subcircuits coupled with multi-conductor interconnects embedded in the substrate. They sometimes cause serious problems of the ...
130
click to vote
DCC
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...