551 search results - page 77 / 111 » Formalizing the Logic-Automaton Connection |
129
click to vote
EUROCRYPT
2009
Springer
16 years 2 months ago
2009
Springer
The fair evaluation and comparison of side-channel attacks and countermeasures has been a long standing open question, limiting further developments in the field. Motivated by this...
121
Voted
MOBIHOC
2009
ACM
16 years 2 months ago
2009
ACM
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
239
click to vote
POPL
2006
ACM
16 years 2 months ago
2006
ACM
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
105
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
111
click to vote
LATA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...