3702 search results - page 132 / 741 » All Pairings Are in a Group |
133
click to vote
RTA
1993
Springer
15 years 10 months ago
1993
Springer
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...
164
click to vote
RECOMB
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. While the discovery of structural variants in the human population is ongoing, most methods for this task assume that the genome is sequenced to high coverage (e.g. 40x),...
206
click to vote
CTRSA
2009
Springer
15 years 10 months ago
2009
Springer
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
162
click to vote
MICCAI
2003
Springer
16 years 7 months ago
2003
Springer
Abstract. This paper presents a disease-oriented evaluation of two recent retinal image registration algorithms, one for aligning pairs of retinal images and one for simultaneously...
114
click to vote
HICSS
2009
IEEE
16 years 1 months ago
2009
IEEE
Suppose there are n applications and n processors. A pair cover is a set S of one-to-one mappings (assignments) of the applications to the processors such that, for every pair (Ai...