503 search results - page 84 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
80
Voted
BMCBI
2006
14 years 9 months ago
2006
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
SPAA
2004
ACM
15 years 2 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
129
Voted
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ICPP
2008
IEEE
15 years 4 months ago
2008
IEEE
—Data replications is a typical strategy for improving access performance and data availability in Data Grid systems. Current works on data replication in Grid systems focus on t...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...