2877 search results - page 299 / 576 » The Complexity of Planarity Testing |
163
click to vote
DATE
2003
IEEE
16 years 2 days ago
2003
IEEE
In this paper is described a software technique allowing to detect soft errors occurring in processor-based digital architectures. The detection mechanism is based on a set of rul...
201
click to vote
ICDAR
2003
IEEE
16 years 2 days ago
2003
IEEE
In this paper we present a new postal envelope segmentation method based on 2-D histogram clustering and watershed transform. Segmentation task consists in detecting the modes ass...
166
click to vote
ICRA
2003
IEEE
16 years 2 days ago
2003
IEEE
Robotic simulation systems allow researchers, engineers, and students to test control algorithms in a safe environment, but until recently these systems only simulated the dynamic...
152
click to vote
IPPS
2003
IEEE
16 years 2 days ago
2003
IEEE
A number of software packages are available for the construction of comprehensive human genetic maps. In this paper we parallelize the widely used package Genehunter. We restrict ...
166
click to vote
COCO
2003
Springer
16 years 20 hour ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...