1029 search results - page 113 / 206 » Compact representations of ordered sets |
177
click to vote
DAGM
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...
189
click to vote
ADCM
2010
15 years 6 months ago
2010
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
164
click to vote
CCE
2007
15 years 6 months ago
2007
In this work, a systematic approach to plant-wide control design is proposed. The method combines ingredients from process networks, thermodynamics and systems theory to derive ro...
153
click to vote
TCAD
2008
15 years 6 months ago
2008
BDDs have proven to be an efficient means to represent and manipulate Boolean formulae [1] and sets [2] due to their compactness and canonicality. In this work, we leverage the eff...
191
Voted
KBS
2002
15 years 6 months ago
2002
In this paper, a hybrid learning approach named HDT is proposed. HDT simulates human reasoning by using symbolic learning to do qualitative analysis and using neural learning to d...