762 search results - page 51 / 153 » Conditionally correct superoptimization |
ESANN
2008
15 years 9 days ago
2008
We propose a modification of the dynamic neural field model of Amari [1], aiming at reducing the simulation effort by employing spaceand frequency representations of the dynamic st...
117
Voted
IJCAI
1997
15 years 5 days ago
1997
Bayesian belief networks have grown to prominence because they provide compact representations of many domains, and there are algorithms to exploit this compactness. The next step...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
IJNSEC
2007
14 years 10 months ago
2007
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
79
Voted
TCS
1998
14 years 10 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...