Sciweavers

1016 search results - page 125 / 204
» Generalized distances between rankings
Sort
View
SIGCOMM
1997
ACM
15 years 5 months ago
Automated Packet Trace Analysis of TCP Implementations
We describe tcpanaly, a tool for automatically analyzing a TCP implementation's behavior by inspecting packet traces of the TCP's activity. Doing so requires surmounting...
Vern Paxson
CCCG
2006
15 years 2 months ago
On the Maximum Span of Fixed-Angle Chains
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
Nadia Benbernou, Joseph O'Rourke
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
15 years 2 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 2 months ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
UAI
2004
15 years 2 months ago
Similarity-Driven Cluster Merging Method for Unsupervised Fuzzy Clustering
In this paper, a similarity-driven cluster merging method is proposed for unsupervised fuzzy clustering. The cluster merging method is used to resolve the problem of cluster valid...
Xuejian Xiong, Kap Luk Chan