Sciweavers

3179 search results - page 504 / 636
» Applications of PCF Theory
Sort
View
IANDC
2008
122views more  IANDC 2008»
13 years 9 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
IDA
2008
Springer
13 years 9 months ago
Symbolic methodology for numeric data mining
Currently statistical and artificial neural network methods dominate in data mining applications. Alternative relational (symbolic) data mining methods have shown their effectivene...
Boris Kovalerchuk, Evgenii Vityaev
CJ
2006
123views more  CJ 2006»
13 years 9 months ago
Unconditionally Secure Anonymous Encryption and Group Authentication
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, H...
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 9 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
ENTCS
2006
115views more  ENTCS 2006»
13 years 9 months ago
Distributed Reactive XML
XML-centric models of computation have been proposed as an answer to the demand for interoperability, heterogeneity and openness in coordination models. We present a prototype imp...
Thomas T. Hildebrandt, Henning Niss, Martin Olsen,...