Sciweavers

528 search results - page 99 / 106
» Computing Large and Small Stable Models
Sort
View
CIVR
2007
Springer
178views Image Analysis» more  CIVR 2007»
14 years 1 months ago
Layout indexing of trademark images
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
Reinier H. van Leuken, M. Fatih Demirci, Victoria ...
CCS
2005
ACM
14 years 1 months ago
Fast dictionary attacks on passwords using time-space tradeoff
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
Arvind Narayanan, Vitaly Shmatikov
ADHOC
2006
97views more  ADHOC 2006»
13 years 7 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
ICS
2001
Tsinghua U.
14 years 2 days ago
Cache performance for multimedia applications
The caching behavior of multimedia applications has been described as having high instruction reference locality within small loops, very large working sets, and poor data cache p...
Nathan T. Slingerland, Alan Jay Smith
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 10 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman