4843 search results - page 314 / 969 » The Shortcut Problem - Complexity and Approximation |
128
click to vote
SIGCOMM
1999
ACM
15 years 8 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
159
Voted
SODA
1993
ACM
15 years 5 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
156
click to vote
CAD
2004
Springer
15 years 3 months ago
2004
Springer
Pottmann et al. propose an iterative optimization scheme for approximating a target curve with a B-spline curve based on square distance minimization, or SDM. The main advantage o...
125
click to vote
TCAD
2002
15 years 3 months ago
2002
As very large scale integration (VLSI) circuit speed rapidly increases, the inductive effects of interconnect lines strongly impact the signal integrity of a circuit. Since these i...
182
click to vote
SIAMSC
2011
14 years 11 months ago
2011
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...