Sciweavers

1578 search results - page 99 / 316
» Algorithmic randomness of continuous functions
Sort
View
CORR
2011
Springer
155views Education» more  CORR 2011»
14 years 4 months ago
Reconciling Compressive Sampling Systems for Spectrally-sparse Continuous-time Signals
The Random Demodulator (RD) and the Modulated Wideband Converter (MWC) are two recently proposed compressed sensing (CS) techniques for the acquisition of continuous-time spectral...
Michael A. Lexa, Mike E. Davies, John S. Thompson
RECOMB
2005
Springer
15 years 10 months ago
Segmentation Conditional Random Fields (SCRFs): A New Approach for Protein Fold Recognition
Abstract. Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e. segmenta...
Yan Liu, Jaime G. Carbonell, Peter Weigele, Vanath...
ECCV
2008
Springer
15 years 8 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
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 8 days ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
ICASSP
2008
IEEE
15 years 4 months ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...