Sciweavers

19320 search results - page 93 / 3864
» On the complexity of computing determinants
Sort
View
JUCS
2000
102views more  JUCS 2000»
15 years 4 months ago
Towards Two-Level Formal Modeling of Computer-Based Systems
: Embedded Computer-based Systems are becoming highly complex and hard to implement because of the large number of concerns the designers have to address. These systems are tightly...
Gabor Karsai, Greg Nordstrom, Ákos Lé...
126
Voted
BMCBI
2010
118views more  BMCBI 2010»
15 years 4 months ago
Computing H/D-Exchange rates of single residues from data of proteolytic fragments
Background: Protein conformation and protein/protein interaction can be elucidated by solution-phase Hydrogen/ Deuterium exchange (sHDX) coupled to high-resolution mass analysis o...
Ernst Althaus, Stefan Canzar, Carsten Ehrler, Mark...
MOC
1998
85views more  MOC 1998»
15 years 4 months ago
Remarks on the Schoof-Elkies-Atkin algorithm
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
L. Dewaghe
CIARP
2005
Springer
15 years 10 months ago
Classifier Selection Based on Data Complexity Measures
Tin Kam Ho and Ester Bernardò Mansilla in 2004 proposed to use data complexity measures to determine the domain of competition of the classifiers. They applied different classifie...
Edith Hernández-Reyes, Jesús Ariel C...
AAAI
2012
13 years 6 months ago
The Price of Neutrality for the Ranked Pairs Method
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
Markus Brill, Felix A. Fischer