Sciweavers

762 search results - page 15 / 153
» Conditionally correct superoptimization
Sort
View
LWA
2004
14 years 11 months ago
A Simple Method For Estimating Conditional Probabilities For SVMs
Support Vector Machines (SVMs) have become a popular learning algorithm, in particular for large, high-dimensional classification problems. SVMs have been shown to give most accur...
Stefan Rüping
72
Voted
AIPS
2010
15 years 22 days ago
Computing Applicability Conditions for Plans with Loops
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
AMAST
2010
Springer
14 years 5 months ago
A Complete Declarative Debugger for Maude
Abstract. We present a declarative debugger for Maude specifications that allows to debug wrong answers (a wrong result is obtained) and missing answers (a correct but incomplete r...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
59
Voted
ICMCS
2005
IEEE
97views Multimedia» more  ICMCS 2005»
15 years 4 months ago
Standard Compatible Error Correction for Multimedia Transmissions Over 802.11 WLAN
In this paper, we analyze a standard compatible error correction technique for multimedia transmissions over 802.11 WLANs that exploits, when available, the information of previou...
Enrico Masala, Antonio Servetti, Juan Carlos De Ma...
86
Voted
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
15 years 2 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...