3628 search results - page 283 / 726 » The Decision Diffie-Hellman Problem |
163
click to vote
SARA
2007
Springer
16 years 23 days ago
2007
Springer
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
219
click to vote
COMPGEOM
2006
ACM
16 years 18 days ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
148
click to vote
FSTTCS
2004
Springer
16 years 22 hour ago
2004
Springer
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
180
click to vote
SAT
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
199
click to vote
SETN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Single classifiers, such as Neural Networks, Support Vector Machines, Decision Trees and other, can be used to perform classification of data for relatively simple proble...