8109 search results - page 1241 / 1622 » A Model of Component-Based Programming |
166
Voted
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
149
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
In the information age, the availability of data on consumer profiles has opened new possibilities for companies to increase their revenue via data mining techniques. One approach...
133
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
We formally specify a payment protocol described in [Vogt et al., 2001]. This protocol is intended for fair exchange of time-sensitive data. Here the µCRL language is used to form...
158
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
157
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...