Sciweavers

588 search results - page 16 / 118
» Reducibility and Completeness in Private Computations
Sort
View
ACISP
2005
Springer
14 years 1 months ago
A Complete Divisor Class Halving Algorithm for Hyperelliptic Curve Cryptosystems of Genus Two
We deal with a divisor class halving algorithm on hyperelliptic curve cryptosystems (HECC), which can be used for scalar multiplication, instead of a doubling algorithm. It is not ...
Izuru Kitamura, Masanobu Katagi, Tsuyoshi Takagi
BMCBI
2007
161views more  BMCBI 2007»
13 years 7 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo
SPAA
2005
ACM
14 years 1 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
BMCBI
2004
196views more  BMCBI 2004»
13 years 7 months ago
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
Background: In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUS...
Robert C. Edgar
ICDE
2011
IEEE
265views Database» more  ICDE 2011»
12 years 11 months ago
RAFTing MapReduce: Fast recovery on the RAFT
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
Jorge-Arnulfo Quiané-Ruiz, Christoph Pinkel...