20197 search results - page 139 / 4040 » Comparing Computational Power |
164
click to vote
TCC
2005
Springer
16 years 8 days ago
2005
Springer
In this work, relations between the security notions standard simulatability and universal simulatability for cryptographic protocols are investigated. A simulatability-based notio...
162
click to vote
CONCUR
2003
Springer
16 years 18 hour ago
2003
Springer
d Abstract) Christel Baier1 , Holger Hermanns2,3 , Joost-Pieter Katoen2 , and Verena Wolf1 1 Institut f¨ur Informatik I, University of Bonn R¨omerstraße 164, D-53117 Bonn, Germa...
177
click to vote
PERCOM
2010
ACM
15 years 10 months ago
2010
ACM
—While there is more to context than location, localization and positioning must continue to be improved. Location-aware applications, such as Google Latitude, are enjoying great...
180
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architectur...
162
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...