1716 search results - page 221 / 344 » Proving Conditional Termination |
180
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
178
click to vote
AUSAI
2003
Springer
15 years 10 months ago
2003
Springer
We investigate why discretization is effective in naive-Bayes learning. We prove a theorem that identifies particular conditions under which discretization will result in naiveBay...
167
click to vote
EUROCRYPT
2010
Springer
15 years 10 months ago
2010
Springer
At CRYPTO 2008 Stam [7] made the following conjecture: if an m + s-bit to s-bit compression function F makes r calls to a primitive f of n-bit input, then a collision for F can be ...
171
click to vote
AAAI
2007
15 years 9 months ago
2007
The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomp...
177
click to vote
FLAIRS
2008
15 years 9 months ago
2008
An efficient framework is proposed for the fast recovery of Bayesian network classifier. A novel algorithm, called Iterative Parent-Child learningBayesian Network Classifier (IPC-...