503 search results - page 24 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
142
Voted
WDAG
2001
Springer
15 years 7 months ago
2001
Springer
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
114
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
: In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a se...
329
Voted
COCOON
2011
Springer
14 years 3 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
142
Voted
ISPD
2004
ACM
15 years 9 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
138
click to vote
ESA
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...