676 search results - page 130 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
102
Voted
IMC
2006
ACM
15 years 7 months ago
2006
ACM
Packet sampling is widely used in network monitoring. Sampled packet streams are often used to determine flow-level statistics of network traffic. To date there is conflicting e...
SIGGRAPH
2010
ACM
15 years 5 months ago
2010
ACM
We present a collision detection (CD) method for complex and large-scale fracturing models that have geometric and topological changes. We first propose a novel dual-cone culling...
140
click to vote
INFOCOM
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
159
click to vote
WG
2010
Springer
15 years 5 days ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
125
click to vote
ALT
2004
Springer
15 years 10 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...