503 search results - page 40 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
134
Voted
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
116
click to vote
AAIM
2010
Springer
15 years 6 months ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
124
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
140
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
128
Voted
IJCAI
2003
15 years 4 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...