Sciweavers

397 search results - page 41 / 80
» Pseudorandom Functions and Lattices
Sort
View
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 12 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
PRIB
2010
Springer
176views Bioinformatics» more  PRIB 2010»
14 years 11 months ago
An On/Off Lattice Approach to Protein Structure Prediction from Contact Maps
Abstract. An important unsolved problem in structural bioinformatics is that of protein structure prediction (PSP), the reconstruction of a biologically plausible three-dimensional...
Stefano Teso, Cristina Di Risio, Andrea Passerini,...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 1 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
SDM
2007
SIAM
98views Data Mining» more  SDM 2007»
15 years 2 months ago
Lattice based Clustering of Temporal Gene-Expression Matrices
Individuals show different cell classes when they are in the different stages of a disease, have different disease subtypes, or have different response to a treatment or envir...
Yang Huang, Martin Farach-Colton
ECCV
2008
Springer
15 years 11 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee