Sciweavers

4212 search results - page 783 / 843
» On Compressible Pairings and Their Computation
Sort
View
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
RECOMB
2010
Springer
16 years 1 months ago
The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
Bjarni V. Halldórsson, Derek Aguiar, Ryan T...
CSIE
2009
IEEE
16 years 1 months ago
Identifying DNA Strands Using a Kernel of Classified Sequences
— Automated DNA sequencing produces a large amount of raw DNA sequence data that then needs to be classified, organized, and annotation. One major application is the comparison o...
Guillermo Tonsmann, David D. Pollock, Wanjun Gu, T...
SEMCO
2009
IEEE
16 years 1 months ago
LexPar: A Freely Available English Paraphrase Lexicon Automatically Extracted from FrameNet
—This is a paper about a new resource, namely an English paraphrase dictionary extracted from the FrameNet lexicon and its example data base. I. THE LEXPAR PARAPHRASE DICTIONARY ...
Bob Coyne, Owen Rambow
ACNS
2009
Springer
142views Cryptology» more  ACNS 2009»
16 years 27 days ago
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
We enrich the classical notion of group key exchange (GKE) protocols by a new property that allows each pair of users to derive an independent peer-to-peer (p2p) key on-demand and ...
Mark Manulis