Sciweavers

7289 search results - page 150 / 1458
» A Dependent Set Theory
Sort
View
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
14 years 1 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan
ICPR
2006
IEEE
14 years 9 months ago
Matching 2D Shapes using their Symmetry Sets
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the ...
Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter...
SAC
2006
ACM
14 years 2 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
JSYML
2010
69views more  JSYML 2010»
13 years 2 months ago
Topological properties of sets definable in weakly o-minimal structures
The paper is aimed at studying the topological dimension for sets definable in weakly o-minimal structures in order to prepare background for further investigation of groups, grou...
Roman Wencel
JSYML
2002
63views more  JSYML 2002»
13 years 7 months ago
Wellordering Proofs for Metapredicative Mahlo
In this article we provide wellordering proofs for metapredicative systems of explicit mathematics and admissible set theory featuring suitable axioms about the Mahloness of the u...
Thomas Strahm