1632 search results - page 198 / 327 » Topological Analysis of Refinement |
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
DSN
2003
IEEE
15 years 4 months ago
2003
IEEE
Internet measurements have shown that network failures happen frequently, and that existing routing protocols can take multiple seconds, or even minutes, to converge after a failu...
ISCAS
2003
IEEE
15 years 4 months ago
2003
IEEE
Higher transistor transition frequencies, lower supply voltages and smaller physical dimensions are, nowadays, general trends in the semiconductor industry. Operating at lower sup...
116
click to vote
IMR
2003
Springer
15 years 4 months 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...
112
click to vote
COMPGEOM
2010
ACM
15 years 4 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 ...