Sciweavers

3353 search results - page 70 / 671
» Laver and set theory
Sort
View
TCS
2008
14 years 9 months ago
Constructibility and decidability versus domain independence and absoluteness
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and ...
Arnon Avron
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
15 years 2 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
15 years 11 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
15 years 3 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
GRC
2008
IEEE
14 years 11 months ago
Fuzzy Preference Relation Rough Sets
Preference analysis is a class of important tasks in multi-criteria decision making. The classical rough set theory was generalized to deal with preference analysis by replacing e...
Qinghua Hu, Daren Yu, Congxin Wu