7892 search results - page 1427 / 1579 » Programming with Models |
128
click to vote
INDOCRYPT
2003
Springer
15 years 6 months ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
124
click to vote
ICDM
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
150
click to vote
ISPAN
2002
IEEE
15 years 6 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
112
click to vote
ISSRE
2002
IEEE
15 years 6 months ago
2002
IEEE
The effectiveness of mutation testing depends heavily on the types of faults that the mutation operators are designed to represent. Therefore, the quality of the mutation operator...
104
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
We have acquired panelist data that provides hedonic (liking) ratings for a set of 40 flavors each composed of the same 7 ingredients at different concentration levels. Our goal...