Sciweavers

5084 search results - page 373 / 1017
» Proving Possibility Properties
Sort
View
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
JAR
2006
87views more  JAR 2006»
15 years 6 months ago
Elimination Transformations for Associative-Commutative Rewriting Systems
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
Keiichirou Kusakari, Masaki Nakamura, Yoshihito To...
JSW
2008
89views more  JSW 2008»
15 years 6 months ago
Secure Set Union and Bag Union Computation for Guaranteeing Anonymity of Distrustful Participants
Abstract-- The computation of the union operator for different distributed datasets involves two challenges when participants are curious and can even act malicious: guaranteeing a...
Stefan Böttcher, Sebastian Obermeier
DMTCS
2007
81views Mathematics» more  DMTCS 2007»
15 years 6 months ago
Regular Languages and Associative Language Descriptions
The Associative Language Description model (ALD) is a combination of locally testable and constituent structure ideas. It is consistent with current views on brain organization an...
Marcella Anselmo, Alessandra Cherubini, Pierluigi ...
200
Voted
JDA
2006
85views more  JDA 2006»
15 years 6 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger