8582 search results - page 41 / 1717 » Here or There |
MFCS
2004
Springer
14 years 3 months ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
MHCI
2004
Springer
14 years 3 months ago
2004
Springer
This paper introduces a method for automatically partitioning richly-formatted electronic documents. An automatic partitioning system has many potential uses, but we focus here on ...
PPSN
2004
Springer
14 years 3 months ago
2004
Springer
Formula One motor racing is a rich sport that spends millions on research and development of highly optimized cars. Here we describe the use of a genetic algorithm to optimize 66 s...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
AC
2003
Springer
14 years 3 months ago
2003
Springer
This tutorial introduces fingerprint recognition systems and their main components: sensing, feature extraction and matching. The basic technologies are surveyed and some state-of-...