503 search results - page 46 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
180
Voted
STACS
2012
Springer
13 years 11 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
124
click to vote
DAM
2011
14 years 10 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
130
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
114
click to vote
TPDS
1998
15 years 3 months ago
1998
—Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, ...
187
click to vote
SDM
2012
SIAM
13 years 6 months ago
2012
SIAM
Compression based pattern mining has been successfully applied to many data mining tasks. We propose an approach based on the minimum description length principle to extract seque...