Sciweavers

2626 search results - page 253 / 526
» The complexity of stochastic sequences
Sort
View
ECCC
2000
113views more  ECCC 2000»
15 years 6 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
ICIP
2010
IEEE
15 years 4 months ago
Compressed domain global motion estimation using the Helmholtz Tradeoff Estimator
Several algorithms for global motion estimation in video sequences using pixel- or block-based approaches have been published. Most known pixel-based methods lack in performance w...
Michael Tok, Alexander Glantz, Marina Georgia Arva...
ICMLA
2009
15 years 4 months ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
CORR
2011
Springer
213views Education» more  CORR 2011»
15 years 1 months ago
Adapting to Non-stationarity with Growing Expert Ensembles
Forecasting sequences by expert ensembles generally assumes stationary or near-stationary processes; however, in complex systems and many real-world applications, we are frequentl...
Cosma Rohilla Shalizi, Abigail Z. Jacobs, Aaron Cl...
INTERSPEECH
2010
15 years 1 months ago
Direct observation of pruning errors (DOPE): a search analysis tool
The search for the optimal word sequence can be performed efficiently even in a speech recognizer with a very large vocabulary and complex models. This is achieved using pruning m...
Volker Steinbiss, Martin Sundermeyer, Hermann Ney