1888 search results - page 242 / 378 » Proof theory and computational analysis |
102
click to vote
MP
2010
15 years 8 days ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
102
click to vote
CCA
2005
Springer
15 years 7 months ago
2005
Springer
kind Reals in Abstract Stone Duality Andrej Bauer and Paul Taylor 3 June 2009 Stone Duality (ASD) is a direct axiomatisation of general topology, in contrast to the traditional an...
132
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
113
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
158
click to vote
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...