8582 search results - page 41 / 1717 » Here or There |
161
click to vote
MFCS
2004
Springer
15 years 11 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...
174
click to vote
MHCI
2004
Springer
15 years 11 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 ...
157
click to vote
PPSN
2004
Springer
15 years 11 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...
158
click to vote
SAT
2004
Springer
15 years 11 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...
205
click to vote
AC
2003
Springer
15 years 11 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-...