Sciweavers

345 search results - page 47 / 69
» Effective memory protection using dynamic tainting
Sort
View
TKDE
2010
184views more  TKDE 2010»
14 years 8 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
ISPASS
2003
IEEE
15 years 3 months ago
Performance study of a cluster runtime system for dynamic interactive stream-oriented applications
Emerging application domains such as interactive vision, animation, and multimedia collaboration display dynamic scalable parallelism, and high computational requirements, making ...
Arnab Paul, Nissim Harel, Sameer Adhikari, Bikash ...
ISCA
2002
IEEE
104views Hardware» more  ISCA 2002»
14 years 9 months ago
Speculative Dynamic Vectorization
Traditional vector architectures have shown to be very effective for regular codes where the compiler can detect data-level parallelism. However, this SIMD parallelism is also pre...
Alex Pajuelo, Antonio González, Mateo Valer...
ISCA
2000
IEEE
111views Hardware» more  ISCA 2000»
15 years 2 months ago
Understanding the backward slices of performance degrading instructions
For many applications, branch mispredictions and cache misses limit a processor’s performance to a level well below its peak instruction throughput. A small fraction of static i...
Craig B. Zilles, Gurindar S. Sohi
75
Voted
CHI
2007
ACM
15 years 10 months ago
Pictures at the ATM: exploring the usability of multiple graphical passwords
Users gain access to cash, confidential information and services at Automated Teller Machines (ATMs) via an authentication process involving a Personal Identification Number (PIN)...
Wendy Moncur, Grégory Leplâtre