Sciweavers

4930 search results - page 117 / 986
» Learning minimal abstractions
Sort
View
EUROPAR
2009
Springer
15 years 4 months ago
Dynamic Detection of Uniform and Affine Vectors in GPGPU Computations
Abstract. We present a hardware mechanism which dynamically detects uniform and affine vectors used in Graphics Processing Units, to minimize pressure on the register file and redu...
Sylvain Collange, David Defour, Yao Zhang
FINTAL
2006
15 years 4 months ago
Discourse Segmentation of German Written Texts
Abstract. Discourse segmentation is the division of a text into minimal discourse segments, which form the leaves in the trees that are used to represent discourse structures. A de...
Harald Lüngen, Csilla Puskás, Maja B&a...
94
Voted
CADE
1998
Springer
15 years 4 months ago
Rank/Activity: A Canonical Form for Binary Resolution
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
Joseph Douglas Horton, Bruce Spencer
125
Voted
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 1 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
AI
2008
Springer
15 years 24 days ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...