15416 search results - page 237 / 3084 » Embeddings of Computable Structures |
177
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
160
click to vote
EUROCAST
2001
Springer
15 years 10 months ago
2001
Springer
We present a Language Prototyping System that facilitates the modular development of interpreters from semantic specifications. The theoretical basis of our system is the integrat...
146
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper presents experimental results for a parallel pipeline STAP system with I/O task implementation using the parallel file systems on the Intel Paragon and the IBM SP. In ...
276
click to vote
MOBISYS
2011
ACM
14 years 8 months ago
2011
ACM
We present an indoor positioning system that measures location using disturbances of the Earth's magnetic field caused by structural steel elements in a building. The presenc...
204
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...