2516 search results - page 19 / 504 » When is there a representer theorem |
159
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
141
Voted
AML
2007
15 years 6 months ago
2007
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each...
113
Voted
CAS
1999
15 years 5 months ago
1999
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...
175
Voted
MFPS
1991
15 years 9 months ago
1991
The problem of decomposing domains into sensible factors is addressed and solved for the case of dI-domains. A decomposition theorem is proved which allows the represention of a l...
118
click to vote
SPAA
2000
ACM
15 years 10 months ago
2000
ACM
The computer industry is currently examining the use of strong synchronization operations such as double compareand-swap (DCAS) as a means of supporting non-blocking synchronizati...