3220 search results - page 250 / 644 » Constrained Graph Processes |
201
click to vote
CAD
2007
Springer
15 years 6 months ago
2007
Springer
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
169
click to vote
ORL
1998
15 years 6 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
148
click to vote
EGH
2009
Springer
15 years 4 months ago
2009
Springer
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
173
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
In order to reduce the rejection rate of our automatic reading system, we propose to pre-classify the business documents by introducing an Automatic Recognition of Documents stage...
186
click to vote
TWC
2010
15 years 1 months ago
2010
In wireless ad hoc networks, relative neighborhood graphs (RNGs) are widely used for topology control. If every node has the same transmission radius, then an RNG can be locally co...