9842 search results - page 267 / 1969 » The Complexity of the Matching-Cut Problem |
126
Voted
ICDM
2005
IEEE
15 years 6 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 ...
90
Voted
COCO
2005
Springer
15 years 6 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...
106
click to vote
CPM
2005
Springer
15 years 6 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...
86
Voted
ISCAS
2003
IEEE
15 years 5 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 ...
100
Voted
DCC
1999
IEEE
15 years 4 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...