1951 search results - page 264 / 391 » An algorithm for improving graph partitions |
207
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
158
click to vote
KIVS
2005
Springer
15 years 12 months ago
2005
Springer
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
183
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
146
click to vote
ACTAC
2007
15 years 6 months ago
2007
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
181
click to vote
SIGMOD
1997
ACM
15 years 10 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...