Sciweavers

261 search results - page 18 / 53
» Complex SLI arithmetic: Representation, algorithms and analy...
Sort
View
BMCBI
2010
154views more  BMCBI 2010»
13 years 8 months ago
Binary image representation of a ligand binding site: its application to efficient sampling of a conformational ensemble
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
Edon Sung, Sangsoo Kim, Whanchul Shin
NIPS
1993
13 years 9 months ago
Analyzing Cross-Connected Networks
The non-linear complexities of neural networks make network solutions difficult to understand. Sanger's contribution analysis is here extended to the analysis of networks aut...
Thomas R. Shultz, Jeffrey L. Elman
MOC
2002
131views more  MOC 2002»
13 years 7 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 7 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
COMPGEOM
2004
ACM
14 years 1 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue