784 search results - page 39 / 157 » Relaxing the Value Restriction |
EUSFLAT
2009
13 years 8 months ago
2009
This paper proposes an approach aimed at obviating empty answers for a family of conjunctive queries involving Boolean or fuzzy value constraints. Contrary to the approaches based ...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
We present theoretical results pertaining to the ability of ℓp minimization to recover sparse and compressible signals from incomplete and noisy measurements. In particular, we ...
DAC
1997
ACM
14 years 2 months ago
1997
ACM
In many computer-aided design tools, binary decision diagrams (BDDs) are used to represent Boolean functions. To increase the efficiency and capability of these tools, many algor...
ICCS
2007
Springer
14 years 2 months ago
2007
Springer
We propose in this paper an extension of Conceptual Graphs that allows to use datatypes (strings, numbers, ...) for typing concept nodes. Though the model-theoretic semantics of th...