2168 search results - page 56 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
115
click to vote
CIKM
2007
Springer
15 years 9 months ago
2007
Springer
As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval ...
123
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
272
click to vote
SDM
2011
SIAM
14 years 6 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
113
Voted
ESANN
2007
15 years 5 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
129
click to vote
WINE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...