Sciweavers

4324 search results - page 348 / 865
» A Generalized Representer Theorem
Sort
View
GC
2007
Springer
15 years 6 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...
SIAMAM
2008
84views more  SIAMAM 2008»
15 years 6 months ago
Effective Transport Equations and Enhanced Backscattering in Random Waveguides
In this paper we derive a general system of transport equations for the moments of reflected and transmitted mode amplitudes in a randomly perturbed waveguide, in a regime where ba...
Josselin Garnier, Knut Sølna
ISCI
2007
135views more  ISCI 2007»
15 years 6 months ago
Generalising the array split obfuscation
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
Stephen Drape
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
15 years 6 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
CORR
2000
Springer
91views Education» more  CORR 2000»
15 years 6 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber