139 search results - page 1 / 28 » Information flow using edge stress factor |
WWW
2005
ACM
14 years 5 months ago
2005
ACM
This paper shows how a corpus of instant messages can be employed to detect de facto communities of practice automatically. A novel algorithm based on the concept of Edge Stress F...
JSS
2008
13 years 3 months ago
2008
This report presents a model-driven, stress test methodology aimed at increasing chances of discovering faults related to network traffic in Distributed Real-Time Systems (DRTS). T...
CSCW
2006
ACM
13 years 10 months ago
2006
ACM
Almost every office worker can relate to feelings of email overload and stress, but in reality the concept of email strain is not well understood. In this paper, we describe a lar...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
ICPR
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper we introduce a novel graphical image representation comprising a single curve—the one-liner. The first step involves the detection and linking of image edges. We ...