1092 search results - page 177 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
103
click to vote
RTCSA
2006
IEEE
15 years 8 months ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
169
click to vote
STOC
2000
ACM
15 years 6 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
100
click to vote
ALT
1999
Springer
15 years 6 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
124
click to vote
JACM
2006
15 years 1 months ago
2006
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
238
click to vote
ICDE
2009
IEEE
16 years 3 months ago
2009
IEEE
Temporal data analysis in data warehouses and data streaming systems often uses time decay to reduce the importance of older tuples, without eliminating their influence, on the res...