5019 search results - page 89 / 1004 » On the Reflexivity of Point Sets |
189
click to vote
CCCG
2006
15 years 7 months ago
2006
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c +...
163
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
181
click to vote
EOR
2010
15 years 6 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
144
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
In scientific computing environments, large amounts of floating-point data often need to be transferred between computers as well as to and from storage devices. Compression can r...
163
click to vote
FUZZIEEE
2007
IEEE
16 years 21 days ago
2007
IEEE
Abstract— Triangular norms or t-norms, in short, and automorphisms are very useful to fuzzy logics in the narrow sense. However, these notions are usually limited to the set [0, ...