Sciweavers

14158 search results - page 155 / 2832
» Generalized switch-setting problems
Sort
View
123
Voted
CCS
2008
ACM
15 years 5 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
BMCBI
2008
171views more  BMCBI 2008»
15 years 3 months ago
A general approach to simultaneous model fitting and variable elimination in response models for biological data with many more
Background: With the advent of high throughput biotechnology data acquisition platforms such as micro arrays, SNP chips and mass spectrometers, data sets with many more variables ...
Harri T. Kiiveri
CJ
1999
95views more  CJ 1999»
15 years 3 months ago
Two Kinds of Probabilistic Induction
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
Ray J. Solomonoff
IWPEC
2004
Springer
15 years 8 months ago
On Miniaturized Problems in Parameterized Complexity Theory
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
Yijia Chen, Jörg Flum
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
15 years 3 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...