Sciweavers

1090 search results - page 141 / 218
» Type-Directed Partial Evaluation
Sort
View
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 10 months ago
(Unconditional) Secure Multiparty Computation with Man-in-the-middle Attacks
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
Shailesh Vaya
BMCBI
2007
166views more  BMCBI 2007»
13 years 10 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
TIT
2008
164views more  TIT 2008»
13 years 10 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung

Publication
412views
15 years 8 months ago
Analyzing Transit Service Reliability using Detailed Data From Automatic Vehicular Locator Systems
The widespread adoption of automated vehicle location systems (AVL) and automatic passenger counters (APC) in the transit industry has opened new venues in operations and system mo...
A. M. El-Geneidy, J. Horning, K. J. Krizek
ICCV
2009
IEEE
15 years 3 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl