Duality and bicrystals on infinite binary matrices
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Today's video codecs employ motion compensated prediction in combination with block matching techniques. These techniques, although achieving some level of adaptivity in their latest versions, continue to rely on the decomposition of frames on a set of art ...
The analysis and interpretation of perturbative modulated electron cyclotron heating (MECH) discharges for power deposition localization using different diagnostics, such as electron cyclotron emission (ECE) and soft x-ray (SXR) measurements, are presented ...
This paper provides a detailed analysis that shows how to stabilize the generalized Schur algorithm, which is a fast procedure for the Cholesky factorization of positive-definite structured matrices R that satisfy displacement equations of the form $R - FR ...
Society for Industrial and Applied Mathematics1996
A polychotomizer which assigns the input to one of K,K≥3, is constructed using a set of dichotomizers which assign the input to one of two classes. We propose techniques to construct a set of linear dichotomizers whose combined decision forms a nonl ...
The benefits obtained from the decomposition of a classification task involving several classes, into a set of smaller classification problems involving two classes only, usually called dichotomies, have been exposed in various occasions. Among the multipl ...
Many important classification problems are emphpolychotomies, emphi.e. the data are organized into K classes with K>2. Given an unknown function F:Omegato1,dots,K representing a polychotomy, an algorithm aimed at ``learning'' this polychotomy ...
This paper proposes a multiresolution Matching Pursuit decomposition of natural images. Matching Pursuit is a greedy algorithm that decomposes any signal into a linear expansion of waveforms taken from a redundant dictionary, by iteratively picking the wav ...
The benefits obtained from the decomposition of a classification task involving several classes, into a set of smaller classification problems involving two classes only, usually called dichotomies, have been exposed in various occasions. Among the multipl ...
This paper proposes a multiresolution Matching Pursuit decomposition of natural images. Matching Pursuit is a greedy algorithm that decomposes any signal into a linear expansion of waveforms taken from a redundant dictionary, by iteratively picking the wav ...
