Sciweavers

1438 search results - page 2 / 288
» A general formalism for the analysis of distributed algorith...
Sort
View
SAC
2010
ACM
14 years 5 days ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
KBSE
2005
IEEE
13 years 11 months ago
Identifying traits with formal concept analysis
Traits are basically mixins or interfaces but with method bodies. In languages that support traits, classes are composed out of traits. There are two main advantages with traits. ...
Adrian Lienhard, Stéphane Ducasse, Gabriela...
EUROCRYPT
1999
Springer
13 years 9 months ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor
JCP
2006
102views more  JCP 2006»
13 years 5 months ago
General Methodology for Analysis and Modeling of Trust Relationships in Distributed Computing
In this paper, we discuss a general methodology for analysis and modeling of trust relationships in distributed computing. We discuss the classification of trust relationships, cat...
Weiliang Zhao, Vijay Varadharajan, George Bryan
IPPS
2006
IEEE
13 years 11 months ago
Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...
Peter Csaba Ölveczky, Stian Thorvaldsen