Sciweavers

1369 search results - page 249 / 274
» Lattice computations for random numbers
Sort
View
QRE
2008
140views more  QRE 2008»
14 years 9 months ago
Discrete mixtures of kernels for Kriging-based optimization
: Kriging-based exploration strategies often rely on a single Ordinary Kriging model which parametric covariance kernel is selected a priori or on the basis of an initial data set....
David Ginsbourger, Céline Helbert, Laurent ...
CVPR
2010
IEEE
15 years 3 months ago
ARISTA - Image Search to Annotation on Billions of Web Photos
Though it has cost great research efforts for decades, object recognition is still a challenging problem. Traditional methods based on machine learning or computer vision are stil...
Xin-Jing Wang, Ming Liu, Lei Zhang, Yi Li, Wei-Yin...
83
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
15 years 10 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
RECOMB
2007
Springer
15 years 10 months ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
Yufeng Wu
IUI
2010
ACM
15 years 6 months ago
A POMDP approach to P300-based brain-computer interfaces
Most of the previous work on non-invasive brain-computer interfaces (BCIs) has been focused on feature extraction and classification algorithms to achieve high performance for the...
Jaeyoung Park, Kee-Eung Kim, Sungho Jo