Sciweavers

1076 search results - page 78 / 216
» Operations on proofs and labels
Sort
View
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 7 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
IACR
2011
88views more  IACR 2011»
12 years 8 months ago
Targeted Malleability: Homomorphic Encryption for Restricted Computations
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
Dan Boneh, Gil Segev, Brent Waters
WWW
2005
ACM
14 years 9 months ago
TJFast: effective processing of XML twig pattern matching
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
Jiaheng Lu, Ting Chen, Tok Wang Ling
CONCUR
2005
Springer
14 years 2 months ago
Deriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...
ER
2006
Springer
112views Database» more  ER 2006»
14 years 18 days ago
A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Johann Eder, Karl Wiggisser