Sciweavers

974 search results - page 18 / 195
» pairing 2010
Sort
View
JOC
2010
106views more  JOC 2010»
14 years 10 months ago
A Taxonomy of Pairing-Friendly Elliptic Curves
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
David Freeman, Michael Scott, Edlyn Teske
ISVC
2010
Springer
14 years 9 months ago
Efficient Marker Matching Using Pair-Wise Constraints in Physical Therapy
In this paper, we report a robust, efficient, and automatic method for matching infrared tracked markers for human motion analysis in computer-aided physical therapy applications. ...
Gregory Johnson, Nianhua Xie, Jill Slaboda, Y. Jus...
PPSN
2010
Springer
14 years 9 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
BMCBI
2010
120views more  BMCBI 2010»
14 years 12 months ago
Short clones or long clones? A simulation study on the use of paired reads in metagenomics
Background: Metagenomics is the study of environmental samples using sequencing. Rapid advances in sequencing technology are fueling a vast increase in the number and scope of met...
Suparna Mitra, Max Schubach, Daniel H. Huson
TAICPART
2010
IEEE
158views Education» more  TAICPART 2010»
14 years 10 months ago
Bad Pairs in Software Testing
Abstract. With pairwise testing, the test model is a list of N parameters. Each test case is an N-tuple; the test space is the cross product of the N parameters. A pairwise test is...
Daniel Hoffman, Chien Chang, Gary Bazdell, Brett S...