4009 search results - page 718 / 802 » Clustering on Complex Graphs |
209
click to vote
FOCS
1997
IEEE
15 years 8 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
161
click to vote
IEEEPACT
1997
IEEE
15 years 8 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
144
click to vote
IPPS
1996
IEEE
15 years 8 months ago
1996
IEEE
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
144
click to vote
CHI
1996
ACM
15 years 8 months ago
1996
ACM
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong typing found in many closed hypertext systems. While this property has directly f...
125
click to vote
VR
1993
IEEE
15 years 8 months ago
1993
IEEE
Existing network management systems typically use a combination of textual displays and 2D directed graph representations of network topology. We are designing a network managemen...