17680 search results - page 3447 / 3536 » Simulation of Computer Systems and Applications |
166
Voted
ACL
1997
15 years 6 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
172
click to vote
DIM
2008
ACM
15 years 6 months ago
2008
ACM
In phishing and pharming, users could be easily tricked into submitting their username/passwords into fraudulent web sites whose appearances look similar as the genuine ones. The ...
156
click to vote
CCS
2010
ACM
15 years 5 months ago
2010
ACM
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
133
Voted
ADHOC
2010
15 years 5 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
123
click to vote
APAL
2010
15 years 5 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...