8413 search results - page 355 / 1683 » Ordering Problem Subgoals |
178
click to vote
NN
1998
Springer
15 years 6 months ago
1998
Springer
Learning long-term temporal dependencies with recurrent neural networks can be a difficult problem. It has recently been shown that a class of recurrent neural networks called NA...
148
click to vote
ASIACRYPT
2007
Springer
16 years 24 days ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
136
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
180
click to vote
ICDM
2007
IEEE
16 years 28 days ago
2007
IEEE
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
206
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...