Sciweavers

405 search results - page 60 / 81
» Approximation properties of the Generalized Finite Element M...
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 7 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
TIT
2010
118views Education» more  TIT 2010»
13 years 2 months ago
Joint sampling distribution between actual and estimated classification errors for linear discriminant analysis
Error estimation must be used to find the accuracy of a designed classifier, an issue that is critical in biomarker discovery for disease diagnosis and prognosis in genomics and p...
Amin Zollanvari, Ulisses Braga-Neto, Edward R. Dou...
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
BMCBI
2010
130views more  BMCBI 2010»
13 years 7 months ago
Amino acid "little Big Bang": Representing amino acid substitution matrices as dot products of Euclidian vectors
Background: Sequence comparisons make use of a one-letter representation for amino acids, the necessary quantitative information being supplied by the substitution matrices. This ...
Karel Zimmermann, Jean-François Gibrat
POPL
2005
ACM
14 years 7 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko