402 search results - page 20 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
TIP
2008
13 years 7 months ago
2008
We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the 1 -norm of the wavelet coefficients of the solution. ...
JSC
2010
13 years 6 months ago
2010
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of e...
CSMR
1998
IEEE
13 years 11 months ago
1998
IEEE
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
ICDT
2003
ACM
14 years 22 days ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
ICTCS
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...