Sciweavers

4277 search results - page 762 / 856
» On Multiple Linear Approximations
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
15 years 10 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
75
Voted
RECOMB
2005
Springer
15 years 10 months ago
Causal Inference of Regulator-Target Pairs by Gene Mapping of Expression Phenotypes
Background: Correlations between polymorphic markers and observed phenotypes provide the basis for mapping traits in quantitative genetics. When the phenotype is gene expression, ...
David Kulp, Manjunatha Jagalur
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
15 years 10 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
DNA
2009
Springer
173views Bioinformatics» more  DNA 2009»
15 years 4 months ago
Time-Complexity of Multilayered DNA Strand Displacement Circuits
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
Georg Seelig, David Soloveichik
MLDM
2009
Springer
15 years 4 months ago
Memory-Based Modeling of Seasonality for Prediction of Climatic Time Series
The paper describes a method for predicting climate time series that consist of significant annual and diurnal seasonal components and a short-term stockastic component. A memory...
Daniel Nikovski, Ganesan Ramachandran