Sciweavers

2631 search results - page 509 / 527
» A Practical Method for the Sparse Resultant
Sort
View
PROMISE
2010
13 years 2 months ago
Modeling the relationship between software effort and size using deming regression
Background: The relation between software effort and size has been modeled in literature as exponential, in the sense that the natural logarithm of effort is expressed as a linear...
Nikolaos Mittas, Makrina Viola Kosti, Vasiliki Arg...
BMCBI
2011
13 years 2 months ago
A theoretical entropy score as a single value to express inhibitor selectivity
Background: Designing maximally selective ligands that act on individual targets is the dominant paradigm in drug discovery. Poor selectivity can underlie toxicity and side effect...
Joost C. M. Uitdehaag, Guido J. R. Zaman
EUROSYS
2011
ACM
12 years 11 months ago
Striking a new balance between program instrumentation and debugging time
Although they are helpful in many cases, state-of-the-art bug reporting systems may impose excessive overhead on users, leak private information, or provide little help to the dev...
Olivier Crameri, Ricardo Bianchini, Willy Zwaenepo...
IACR
2011
89views more  IACR 2011»
12 years 7 months ago
Identity-Based Decryption
Identity-based decryption is an alternative to identity-based encryption, in which Alice encrypts a symmetric key for Bob under a trusted authority’s public key. Alice sends Bob...
Daniel R. L. Brown
CVPR
2008
IEEE
14 years 9 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán