Sciweavers

470 search results - page 90 / 94
» Using Unknown Word Techniques to Learn Known Words
Sort
View
SPAA
1996
ACM
13 years 12 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
JOC
2010
82views more  JOC 2010»
13 years 2 months ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
Jens Groth
AB
2007
Springer
13 years 11 months ago
Efficient Haplotype Inference with Pseudo-boolean Optimization
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
Ana Graça, João Marques-Silva, In&ec...
TREC
2001
13 years 9 months ago
Link-based Approaches for Text Retrieval
We assess a family of ranking mechanisms for search engines based on linkage analysis using a carefully engineered subset of the World Wide Web, WT10g (Bailey, Craswell and Hawking...
Julien Gevrey, Stefan M. Rüger
CVIU
2006
168views more  CVIU 2006»
13 years 7 months ago
Fitting conics to paracatadioptric projections of lines
The paracatadioptric camera is one of the most popular panoramic systems currently available in the market. It provides a wide field of view by combining a parabolic shaped mirror...
João P. Barreto, Helder Araújo