Sciweavers

5153 search results - page 396 / 1031
» Introduction to Randomized Algorithms
Sort
View
CVPR
2008
IEEE
16 years 6 months ago
Auto-context and its application to high-level vision tasks
The notion of using context information for solving highlevel vision problems has been increasingly realized in the field. However, how to learn an effective and efficient context...
Zhuowen Tu
116
Voted
ECML
2006
Springer
15 years 8 months ago
Why Is Rule Learning Optimistic and How to Correct It
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
Martin Mozina, Janez Demsar, Jure Zabkar, Ivan Bra...
STOC
1995
ACM
88views Algorithms» more  STOC 1995»
15 years 8 months ago
Linear-time encodable and decodable error-correcting codes
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...
Daniel A. Spielman
SODA
2001
ACM
80views Algorithms» more  SODA 2001»
15 years 6 months ago
On the discrete Bak-Sneppen model of self-organized criticality
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
Jérémy Barbay, Claire Kenyon
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 5 months ago
On MMSE and MAP Denoising Under Sparse Representation Modeling Over a Unitary Dictionary
Among the many ways to model signals, a recent approach that draws considerable attention is sparse representation modeling. In this model, the signal is assumed to be generated a...
Javier Turek, Irad Yavneh, Matan Protter, Michael ...