993 search results - page 1 / 199 » Set Constraints on Regular Terms |
CSL
2004
Springer
13 years 10 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
ECIR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Traditional retrieval models assume that query terms are independent and rank documents primarily based on various term weighting strategies including TF-IDF and document...
VLDB
1999
ACM
13 years 9 months ago
1999
ACM
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
ICIP
2005
IEEE
14 years 6 months ago
2005
IEEE
This paper proposes an original inhomogeneous restoration (deconvolution) model under the Bayesian framework. In this model, regularization is achieved, during the iterative resto...