3328 search results - page 307 / 666 » Topological Quantum Computation |
217
Voted
IMR
2003
Springer
16 years 21 days ago
2003
Springer
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
226
click to vote
COMPGEOM
2010
ACM
16 years 18 days 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 ...
213
Voted
VISUALIZATION
2002
IEEE
16 years 13 days ago
2002
IEEE
Isosurfaces are commonly used to visualize scalar fields. Critical isovalues indicate isosurface topology changes: the creation of new surface components, merging of surface comp...
230
click to vote
PDP
2010
IEEE
15 years 12 months ago
2010
IEEE
The increasing numbers of cores, shared caches and memory nodes within machines introduces a complex hardware topology. High-performance computing applications now have to carefull...
209
Voted
CGI
1999
IEEE
15 years 12 months ago
1999
IEEE
Existing data embedding algorithms for polygonal meshes and their attributes can't be applied to the majority of (geometric) computer aided design (CAD) applications, for two...