199 search results - page 13 / 40 » Intensional Positive Set Theory |
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
102
click to vote
SIGACT
2008
14 years 11 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
ICASSP
2010
IEEE
14 years 12 months ago
2010
IEEE
In pattern recognition, data integration is a processing method to combine multiple sources so that the combined result can be more accurate than a single source. Evidence theory ...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
CSR
2007
Springer
15 years 3 months ago
2007
Springer
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...