Sciweavers

1279 search results - page 83 / 256
» Fast Implementations of Automata Computations
Sort
View
ICIP
2002
IEEE
14 years 10 months ago
Full search content independent block matching based on the fast Fourier transform
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
Mark S. Drew, Steven L. Kilthau, Torsten Möll...
SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
Chaki Ng, David C. Parkes, Margo I. Seltzer
LCN
2002
IEEE
14 years 1 months ago
Performance Analysis of Token-Based Fast TCP in Systems Supporting Large Windows
Since TCP can only detect congestion after packet losses have already happened, various forms of Fast TCP (FTCP) have been proposed to notify congestion early and avoid packet los...
Fei Peng, Victor C. M. Leung
IPPS
2009
IEEE
14 years 3 months ago
Input-independent, scalable and fast string matching on the Cray XMT
String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of o...
Oreste Villa, Daniel G. Chavarría-Miranda, ...
IPPS
2006
IEEE
14 years 3 months ago
A multiprocessor architecture for the massively parallel model GCA
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
Wolfgang Heenes, Rolf Hoffmann, Johannes Jendrsczo...