Sciweavers

1729 search results - page 294 / 346
» Generic Haskell: Applications
Sort
View
CN
2006
117views more  CN 2006»
13 years 9 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
IBIS
2006
109views more  IBIS 2006»
13 years 9 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
IDA
2006
Springer
13 years 9 months ago
Supporting bi-cluster interpretation in 0/1 data by means of local patterns
Clustering or co-clustering techniques have been proved useful in many application domains. A weakness of these techniques remains the poor support for grouping characterization. ...
Ruggero G. Pensa, Céline Robardet, Jean-Fra...
JMLR
2008
148views more  JMLR 2008»
13 years 8 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
DKE
2007
107views more  DKE 2007»
13 years 8 months ago
Design time analysis of multiagent protocols
Interaction protocols enable agents to communicate with each other effectively. Whereas several approaches exist to specify interaction protocols, none of them has design tools t...
Pinar Yolum