Sciweavers

6434 search results - page 902 / 1287
» Model Transformations with Reference Models
Sort
View
133
Voted
COCOON
2005
Springer
15 years 10 months ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier
ICALP
2005
Springer
15 years 10 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
128
Voted
ICCSA
2005
Springer
15 years 10 months ago
A Penalized Likelihood Estimation on Transcriptional Module-Based Clustering
In this paper, we propose a new clustering procedure for high dimensional microarray data. Major difficulty in cluster analysis of microarray data is that the number of samples to ...
Ryo Yoshida, Seiya Imoto, Tomoyuki Higuchi
ASSETS
2004
ACM
15 years 10 months ago
Middleware to expand context and preview in hypertext
Movement, or mobility, is key to the accessibility, design, and usability of many hypermedia resources (websites); and key to good mobility is context and preview by probing. This...
Simon Harper, Carole A. Goble, Robert Stevens, Yel...
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
15 years 10 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy