13603 search results - page 2721 / 2721 » On the Computational Complexity of Cut-Reduction |
ISPA
2005
Springer
14 years 25 days ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
COMPGEOM
2010
ACM
14 years 13 days ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
DSD
2002
IEEE
14 years 9 days ago
2002
IEEE
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those ...