Sciweavers

522 search results - page 10 / 105
» The 3-Steiner Root Problem
Sort
View
CONEXT
2005
ACM
13 years 10 months ago
Root cause analysis for long-lived TCP connections
While the applications using the Internet have changed over time, TCP is still the dominating transport protocol that carries over 90% of the total traffic. Throughput is the key...
Matti Siekkinen, Guillaume Urvoy-Keller, Ernst W. ...
SIGMETRICS
2008
ACM
175views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
DARC: dynamic analysis of root causes of latency distributions
OSprof is a versatile, portable, and efficient profiling methodology based on the analysis of latency distributions. Although OSprof has offers several unique benefits and has bee...
Avishay Traeger, Ivan Deras, Erez Zadok
ACSAC
2001
IEEE
14 years 8 days ago
Mining Alarm Clusters to Improve Alarm Handling Efficiency
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
Klaus Julisch
JCT
2008
120views more  JCT 2008»
13 years 8 months ago
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
Tamás Király, Lap Chi Lau
CIAC
2006
Springer
79views Algorithms» more  CIAC 2006»
14 years 10 days ago
Matching Subsequences in Trees
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
Philip Bille, Inge Li Gørtz