Sciweavers

633 search results - page 28 / 127
» A Few Constructions on Constructors
Sort
View
IJCAI
2003
15 years 3 months ago
Efficient Symmetry Breaking for Boolean Satisfiability
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
Fadi A. Aloul, Karem A. Sakallah, Igor L. Markov
IMCSIT
2010
14 years 11 months ago
Parallel, Massive Processing in SuperMatrix - a General Tool for Distributional Semantic Analysis of Corpus
The paper presents an extended version of the SuperMatrix system -- a general tool supporting automatic acquisition of lexical semantic relations from corpora. Extensions focus mai...
Bartosz Broda, Damian Jaworski, Maciej Piasecki
IEAAIE
2007
Springer
15 years 8 months ago
Automatic Fingerprints Image Generation Using Evolutionary Algorithm
Constructing a fingerprint database is important to evaluate the performance of automatic fingerprint recognition systems. Because of the difficulty in collecting fingerprint sampl...
Ung-Keun Cho, Jin-Hyuk Hong, Sung-Bae Cho
DLS
2005
148views Languages» more  DLS 2005»
15 years 3 months ago
Compile-time meta-programming in a dynamically typed OO language
Compile-time meta-programming allows programs to be constructed by the user at compile-time. Although LISP derived languages have long had such facilities, few modern languages ar...
Laurence Tratt
JAPLL
2006
114views more  JAPLL 2006»
15 years 1 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle