4066 search results - page 134 / 814 » Almost Complete Sets |
150
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
144
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
176
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
152
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
153
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between...