Sciweavers

11231 search results - page 2023 / 2247
» Digging for Data Structures
Sort
View
134
Voted
ACTA
2008
136views more  ACTA 2008»
15 years 3 months ago
Two-dimensional packing with conflicts
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
Leah Epstein, Asaf Levin, Rob van Stee
ADCM
2008
136views more  ADCM 2008»
15 years 3 months ago
Learning and approximation by Gaussians on Riemannian manifolds
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
Gui-Bo Ye, Ding-Xuan Zhou
AI
2008
Springer
15 years 3 months 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...
AIEDU
2007
85views more  AIEDU 2007»
15 years 3 months ago
Opening up the Interpretation Process in an Open Learner Model
Opening a model of the learner is a potentially complex operation. There are many aspects of the learner that can be modelled, and many of these aspects may need to be opened in di...
Nicolas van Labeke, Paul Brna, Rafael Morales
BIB
2008
86views more  BIB 2008»
15 years 3 months ago
Recent developments in the MAFFT multiple sequence alignment program
The accuracy and scalability of multiple sequence alignment (MSA) of DNAs and proteins have long been and are still important issues in bioinformatics. To rapidly construct a reas...
Kazutaka Katoh, Hiroyuki Toh
« Prev « First page 2023 / 2247 Last » Next »