567 search results - page 21 / 114 » Exact train pathing |
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...
NN
1998
Springer
14 years 11 months ago
1998
Springer
Cross validation can be used to detect when over tting starts during supervised training of a neural network; training is then stopped before convergence to avoid the overtting ...
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
ASPDAC
2005
ACM
15 years 1 months ago
2005
ACM
— This paper propose a systematic method to select power/ground wires that should be considered in interconnect RL extraction. The return current distribution affects loop charac...
114
click to vote
TCS
2011
14 years 6 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...