Sciweavers

2517 search results - page 45 / 504
» Specifying Weak Sets
Sort
View
FSTTCS
2007
Springer
15 years 6 months ago
Non-mitotic Sets
We study the question of the existence of non-mitotic sets in NP. We show under various hypotheses that • 1-tt-mitoticity and m-mitoticity differ on NP. • 1-tt-reducibility a...
Christian Glaßer, Alan L. Selman, Stephen D....
FROCOS
2009
Springer
15 years 6 months ago
Combining Theories with Shared Set Operations
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
Thomas Wies, Ruzica Piskac, Viktor Kuncak
AAAI
2007
15 years 2 months ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
JAT
2010
80views more  JAT 2010»
14 years 10 months ago
The Bregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces
We present some sufficient conditions ensuring the upper semicontinuity and the continuity of the Bregman projection operator Π g C and the relative projection operator P g C in...
Chong Li, Wen Song, Jen-Chih Yao
ICIP
2003
IEEE
16 years 1 months ago
Robust object boundary determination using a locally adaptive level set algorithm
This paper introduces a level set methodology for the precise boundary localization of image objects within an indicated region, designed to be particularly robust against weak or...
Eftychios Sifakis, George Tziritas