2813 search results - page 281 / 563 » Formalizing Architectural Connection |
164
Voted
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
154
click to vote
PKDD
2005
Springer
16 years 3 days ago
2005
Springer
Bi-clustering is a promising conceptual clustering approach. Within categorical data, it provides a collection of (possibly overlapping) bi-clusters, i.e., linked clusters for both...
177
click to vote
KES
2004
Springer
16 years 3 hour ago
2004
Springer
In this case study I argue for the usage of a machine-oriented controlled natural language as interface language to knowledge systems. Instead of using formal languages that are di...
156
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
Kahn defined a formal model for networks of processes that communicate through channels carrying streams of data tokens. His mathematical results show the necessary conditions fo...
144
click to vote
ICCS
2003
Springer
15 years 12 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...