Sciweavers

1855 search results - page 141 / 371
» A coding theorem for distributed computation
Sort
View
RTCSA
2007
IEEE
15 years 9 months ago
Scheduling Algorithms for I/O Blockings with a Multi-frame Task Model
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
Shan Ding, Hiroyuki Tomiyama, Hiroaki Takada
CVPR
2012
IEEE
13 years 5 months ago
Fast search in Hamming space with multi-index hashing
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision applications. Although binary codes are motivated by their ...
Mohammad Emtiyaz Norouzi, Ali Punjani, David J. Fl...
PPOPP
2003
ACM
15 years 8 months ago
Factorization with morton-ordered quadtree matrices for memory re-use and parallelism
Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this bloc...
Jeremy D. Frens, David S. Wise
143
Voted
ACSAC
2007
IEEE
15 years 9 months ago
Limits of Static Analysis for Malware Detection
Malicious code is an increasingly important problem that threatens the security of computer systems. The traditional line of defense against malware is composed of malware detecto...
Andreas Moser, Christopher Kruegel, Engin Kirda
144
Voted
EDOC
2006
IEEE
15 years 9 months ago
Model Driven Design of Distribution Patterns for Web Service Compositions
Increasingly, distributed systems are being constructed by composing a number of discrete components. This practice, termed composition, is particularly prevalent within the Web s...
Ronan Barrett, Claus Pahl