Sciweavers

1021 search results - page 185 / 205
» Fast Approximate PCPs
Sort
View
BMCBI
2007
107views more  BMCBI 2007»
13 years 9 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
CGF
2008
121views more  CGF 2008»
13 years 9 months ago
Tensor Clustering for Rendering Many-Light Animations
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
Milos Hasan, Edgar Velázquez-Armendá...
BMCBI
2006
101views more  BMCBI 2006»
13 years 9 months ago
SynTReN: a generator of synthetic gene expression data for design and analysis of structure learning algorithms
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
Tim Van den Bulcke, Koen Van Leemput, Bart Naudts,...
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 9 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
JCC
2006
110views more  JCC 2006»
13 years 9 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs