Sciweavers

1511 search results - page 71 / 303
» Relational Parametricity for Computational Effects
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
15 years 4 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
BMCBI
2007
88views more  BMCBI 2007»
15 years 4 months ago
Computational analysis of the relationship between allergenicity and digestibility of allergenic proteins in simulated gastric f
Background: Safety assessment of genetically modified (GM) food, with regard to allergenic potential of transgene-encoded xenoproteins, typically involves several different method...
Bingjun Jiang, Hong Qu, Yuanlei Hu, Ting Ni, Zhong...
POPL
2009
ACM
16 years 5 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
ICCV
1995
IEEE
15 years 8 months ago
Algorithms for Implicit Deformable Models
This paper presents a framework for implicit deformable models and a pair of new algorithms for solving the nonlinear partial di erential equations that result from this framework...
Ross T. Whitaker
UAI
2000
15 years 5 months ago
Gaussian Process Networks
In this paper we address the problem of learning the structure of a Bayesian network in domains with continuous variables. This task requires a procedure for comparing different c...
Nir Friedman, Iftach Nachman