1414 search results - page 180 / 283 » Randomness and Universal Machines |
126
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
160
click to vote
SAT
2010
Springer
15 years 1 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
165
Voted
CAIP
2009
Springer
15 years 1 months ago
2009
Springer
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textu...
126
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Learning a sequence classifier means learning to predict a sequence of output tags based on a set of input data items. For example, recognizing that a handwritten word is "ca...
113
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...