836 search results - page 50 / 168 » On the Complexity of Train Assignment Problems |
137
click to vote
IUI
2009
ACM
16 years 21 days ago
2009
ACM
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
131
click to vote
TMC
2002
15 years 3 months ago
2002
This paper proposes a scheme of optimal resource management for reverse-link transmissions in multimedia wideband code-division multiple-access (WCDMA) communications. It is to gua...
128
click to vote
AAAI
2006
15 years 5 months ago
2006
While computers have defeated the best human players in many classic board games, progress in Go remains elusive. The large branching factor in the game makes traditional adversar...
127
click to vote
NIPS
1994
15 years 5 months ago
1994
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
138
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...