402 search results - page 72 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
CD
2005
Springer
14 years 2 months ago
2005
Springer
Recent studies showed potential for using component frameworks for building flexible adaptible applications for deployment in distributed environments. However this approach is h...
ILP
2003
Springer
14 years 1 months ago
2003
Springer
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
TIME
1994
IEEE
14 years 22 days ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...