Sciweavers

26354 search results - page 330 / 5271
» How we refactor, and how we know it
Sort
View
CORR
2012
Springer
187views Education» more  CORR 2012»
14 years 2 months ago
Sequential Inference for Latent Force Models
Latent force models (LFMs) are hybrid models combining mechanistic principles with non-parametric components. In this article, we shall show how LFMs can be equivalently formulate...
Jouni Hartikainen, Simo Särkkä
BMCBI
2007
105views more  BMCBI 2007»
15 years 6 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
13 years 9 months ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
PERSUASIVE
2007
Springer
16 years 28 days ago
Group Reactions to Visual Feedback Tools
This paper presents findings on how individuals respond to receiving feedback on their participation levels during meetings. Comparing in-lab and natural group settings, repeated u...
Joan Morris DiMicco, Walter Bender
CRYPTO
2004
Springer
126views Cryptology» more  CRYPTO 2004»
16 years 6 days ago
Compressed Pairings
Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we s...
Michael Scott, Paulo S. L. M. Barreto