1763 search results - page 137 / 353 » A Formalization of Polytime Functions |
137
click to vote
PLPV
2011
ACM
14 years 26 days ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
TKDE
2012
13 years 12 days ago
2012
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
CCS
2008
ACM
15 years 16 hour ago
2008
ACM
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...
109
click to vote
CIDR
2011
14 years 1 months ago
2011
End-to-end data processing environments are often comprised of several independently-developed (sub-)systems, e.g. for engineering, organizational or historical reasons. Unfortuna...
EMSOFT
2011
Springer
13 years 9 months ago
2011
Springer
Given a multi-modal dynamical system, optimal switching logic synthesis involves generating conditions for switching between the system modes such that the resulting hybrid system...