Sciweavers

16430 search results - page 634 / 3286
» On Computable Tree Functions
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 2 months ago
A recombination algorithm for the decomposition of multivariate rational functions
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
Guillaume Chèze
VISUALIZATION
2005
IEEE
16 years 23 days ago
Rendering Tetrahedral Meshes with Higher-Order Attenuation Functions for Digital Radiograph Reconstruction
This paper presents a novel method for computing simulated x-ray images, or DRRs (digitally reconstructed radiographs), of tetrahedral meshes with higher-order attenuation functio...
Ofri Sadowsky, Jonathan D. Cohen, Russell H. Taylo...
WCRE
2005
IEEE
16 years 23 days ago
When Functions Change Their Names: Automatic Detection of Origin Relationships
It is a common understanding that identifying the same entity such as module, file, and function between revisions is important for software evolution related analysis. Most softw...
Sunghun Kim, Kai Pan, E. James Whitehead Jr.
BMCBI
2006
111views more  BMCBI 2006»
15 years 7 months ago
PepDist: A New Framework for Protein-Peptide Binding Prediction based on Learning Peptide Distance Functions
Background: Many different aspects of cellular signalling, trafficking and targeting mechanisms are mediated by interactions between proteins and peptides. Representative examples...
Tomer Hertz, Chen Yanover
CSR
2011
Springer
14 years 10 months ago
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov