1434 search results - page 270 / 287 » Distributed Computing with Imperfect Randomness |
IPSN
2004
Springer
14 years 26 days ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
SIGMOD
2010
ACM
14 years 9 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
ECCV
2000
Springer
13 years 12 months ago
2000
Springer
This paper offers a novel detection method, which works well even in the case of a complicated image collection – for instance, a frontal face under a large class of linear tran...
MASCOTS
2010
13 years 9 months ago
2010
: New Algorithms for File System Cooperative Caching Eric Anderson, Christopher Hoover, Xiaozhou Li HP Laboratories HPL-2010-69 cooperative caching We present two new cooperative ...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...