1871 search results - page 103 / 375 » The Ephemeral Pairing Problem |
DM
2010
14 years 11 months ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We develop a new collaborative filtering (CF) method that combines both previously known users' preferences, i.e. standard CF, as well as product/user attributes, i.e. classi...
117
click to vote
DAM
2002
14 years 11 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
IJON
2002
14 years 11 months ago
2002
: A new supervised learning procedure for training RBF networks is proposed. It uses a pair of parallel running Kalman filters to sequentially update both the output weights and th...
NAACL
2010
14 years 9 months ago
2010
We describe a synchronous parsing algorithm that is based on two successive monolingual parses of an input sentence pair. Although the worst-case complexity of this algorithm is a...