2496 search results - page 136 / 500 » On covering by translates of a set |
270
click to vote
MLQ
2011
15 years 1 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...
164
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Alignments of homologous DNA sequences are crucial for comparative genomics and phylogenetic analysis. However, multiple alignment represents a computationally difficu...
133
click to vote
ASPDAC
2000
ACM
15 years 11 months ago
2000
ACM
A new approach is proposed to translate existing software programs from one instruction set to other instruction sets at the level. The behaviors of instructions are abstractly re...
171
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
168
click to vote
CISIS
2008
IEEE
16 years 29 days ago
2008
IEEE
Solving problems raised by heterogeneous ontologies can be achieved by matching the ontologies and processing the resulting alignments. This is typical of data mediation in which ...