Sciweavers

2924 search results - page 171 / 585
» Lower Bounds in Distributed Computing
Sort
View
TCS
2011
14 years 8 months ago
Four states are enough!
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
Nicolas Ollinger, Gaétan Richard
98
Voted
CLUSTER
2006
IEEE
15 years 7 months ago
Matrix Multiplication on Two Interconnected Processors
This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the ...
Brett A. Becker, Alexey L. Lastovetsky
91
Voted
PODC
2010
ACM
15 years 5 months ago
Brief announcement: asynchronous bounded expected delay networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
107
Voted
ICPP
2008
IEEE
15 years 7 months ago
Bounded LSH for Similarity Search in Peer-to-Peer File Systems
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
Yu Hua, Bin Xiao, Dan Feng, Bo Yu
119
Voted
ICPR
2008
IEEE
16 years 2 months ago
On using error bounds to optimize cost-sensitive multimodal biometric authentication
While using more biometric traits in multimodal biometric fusion can effectively increase the system robustness, often, the cost associated to adding additional systems is not con...
Norman Poh, Josef Kittler