9842 search results - page 70 / 1969 » The Complexity of the Matching-Cut Problem |
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
COMPGEOM
1997
ACM
13 years 12 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
BIRTHDAY
1991
Springer
13 years 11 months ago
1991
Springer
: In this paper, we present a software engineer's view of user-interface development. First, we illustrate the main problem areas responsible for difficulties in building high...
NIPS
2001
13 years 9 months ago
2001
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...