2254 search results - page 369 / 451 » Computing the minimal covering set |
169
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
228
click to vote
BMCBI
2011
15 years 26 days ago
2011
Background: Genomic position (GP) files currently used in next-generation sequencing (NGS) studies are always difficult to manipulate due to their huge size and the lack of approp...
146
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper describes a new framework for the automated tracking of the central retinal vein in retinal images. The procedure first computes a binary image of the retinal vasculatur...
151
click to vote
ICIP
2002
IEEE
16 years 7 months ago
2002
IEEE
In this paper, we propose a novel algorithm to smooth and simplify simultaneously range images and also triangle meshes derived from those images. These data sets often suffer fro...
283
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...