724 search results - page 32 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
83
Voted
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
130
click to vote
SPAA
1996
ACM
15 years 3 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
119
click to vote
DATAMINE
2002
14 years 11 months ago
2002
Collaborative recommender systems allow personalization for e-commerce by exploiting similarities and dissimilarities among customers' preferences. We investigate the use of a...
98
Voted
ESA
2008
Springer
15 years 1 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
123
click to vote
ICPP
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...