Sciweavers

676 search results - page 130 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
IMC
2006
ACM
14 years 1 months ago
Fisher information of sampled packets: an application to flow size estimation
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...
Bruno F. Ribeiro, Donald F. Towsley, Tao Ye, Jean ...
SIGGRAPH
2010
ACM
13 years 11 months ago
FASTCD: fracturing-aware stable collision detection
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...
Jae-Pil Heo, Duksu Kim, Joon-Kyung Seong, Jeong-Mo...
INFOCOM
2000
IEEE
13 years 11 months ago
A Predictability Analysis of Network Traffic
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...
Aimin Sang, San-qi Li
WG
2010
Springer
13 years 5 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θ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...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
ALT
2004
Springer
14 years 4 months ago
On Kernels, Margins, and Low-Dimensional Mappings
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...
Maria-Florina Balcan, Avrim Blum, Santosh Vempala