2924 search results - page 209 / 585 » Lower Bounds in Distributed Computing |
100
Voted
MOBIHOC
2009
ACM
16 years 3 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
137
Voted
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
142
click to vote
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
118
click to vote
PODC
1997
ACM
15 years 7 months ago
1997
ACM
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
128
click to vote
CSREASAM
2003
15 years 4 months ago
2003
Computational web portals provide uniform access to remote computational resources--hardware, software, and data--by hiding the complexity of the heterogeneous, distributed, high ...