8 search results - page 1 / 2 » Complete Sets of Hamiltonian Circuits for Classification of ... |
EUROCAST
2009
Springer
13 years 8 months ago
2009
Springer
The calculation of Hamiltonian Circuits is an NP-complete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The sol...
AI
2004
Springer
13 years 4 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
WWW
2003
ACM
14 years 5 months ago
2003
ACM
The web contains a wealth of product reviews, but sifting through them is a daunting task. Ideally, an opinion mining tool would process a set of search results for a given item, ...
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
DAC
2004
ACM
14 years 5 months ago
2004
ACM
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...