Sciweavers

17 search results - page 2 / 4
» Theoretical analysis of generalised recombination
Sort
View
CGF
2008
111views more  CGF 2008»
13 years 7 months ago
An Analysis of the In-Out BRDF Factorization for View-Dependent Relighting
Interactive rendering with dynamic natural lighting and changing view is a long-standing goal in computer graphics. Recently, precomputation-based methods for all-frequency religh...
Dhruv Mahajan, Yu-Ting Tseng, Ravi Ramamoorthi
BMCBI
2005
67views more  BMCBI 2005»
13 years 7 months ago
Selecting additional tag SNPs for tolerating missing data in genotyping
Background: Recent studies have shown that the patterns of linkage disequilibrium observed in human populations have a block-like structure, and a small subset of SNPs (called tag...
Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao
RTA
2010
Springer
13 years 11 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
ICALP
2004
Springer
14 years 22 days ago
Representing Nested Inductive Types Using W-Types
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
Michael Abbott, Thorsten Altenkirch, Neil Ghani
TABLEAUX
2000
Springer
13 years 11 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks