Sciweavers

4324 search results - page 490 / 865
» A Generalized Representer Theorem
Sort
View
165
Voted
ENTCS
2007
100views more  ENTCS 2007»
15 years 6 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
163
Voted
TALG
2008
127views more  TALG 2008»
15 years 6 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
EOR
2002
89views more  EOR 2002»
15 years 6 months ago
Analytic centers and repelling inequalities
ct 9 The new concepts of repelling inequalities, repelling paths, and prime analytic centers are introduced. A repelling 10 path is a generalization of the analytic central path fo...
Richard J. Caron, Harvey J. Greenberg, Allen G. Ho...
JSC
2000
69views more  JSC 2000»
15 years 6 months ago
Generic Polynomials with Few Parameters
We call a polynomial g(t1, . . . , tm, X) over a field K generic for a group G if it has Galois group G as a polynomial in X, and if every Galois field extension N/L with K L and...
Gregor Kemper, Elena Mattig
162
Voted
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 6 months ago
Name Strategy: Its Existence and Implications
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...
Mark D. Roberts