2430 search results - page 340 / 486 » Computing Tutte Polynomials |
KR
2000
Springer
15 years 7 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
111
click to vote
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
131
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
95
Voted
NIPS
2003
15 years 4 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
115
Voted
IJCAI
1997
15 years 4 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...