974 search results - page 12 / 195 » pairing 2010 |
BMCBI
2010
13 years 7 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
WAIFI
2010
Springer
14 years 20 days ago
2010
Springer
Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...
PAIRING
2010
Springer
13 years 6 months ago
2010
Springer
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
NAACL
2010
13 years 5 months ago
2010
In this paper we investigate how to identify initiation-response pairs in asynchronous, multi-threaded, multi-party conversations. We formulate the task of identifying initiation-...
ECCV
2010
Springer
14 years 25 days ago
2010
Springer
Abstract. We study the problem of multimodal dimensionality reduction assuming that data samples can be missing at training time, and not all data modalities may be present at appl...