2084 search results - page 377 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
AAECC
2001
Springer
15 years 2 months ago
2001
Springer
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
100
click to vote
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
Power gating is one of the most effective techniques in reducing the standby leakage current of VLSI circuits. In this paper we introduce a new approach for sleep transistor sizin...
66
Voted
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
MOBIHOC
2001
ACM
15 years 9 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
106
click to vote
ICCV
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...