5214 search results - page 161 / 1043 » The Online Specialization Problem |
213
Voted
ARC
2012
Springer
13 years 11 months ago
2012
Springer
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
180
click to vote
ICML
1995
IEEE
16 years 4 months ago
1995
IEEE
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
104
Voted
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
— Consider the two-terminal partial side information problem, where one source is decoded under a distortion measure, while the other acts as a helper. There are two well known i...
109
click to vote
EDBTW
2010
Springer
15 years 9 months ago
2010
Springer
We study the problem of update propagation across views in the setting where both the view and the source database are XML documents. We consider a simple class of XML views that ...
143
Voted
ESA
1997
Springer
15 years 8 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...