326 search results - page 40 / 66 » Closing the Gap |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
83
Voted
IANDC
2008
14 years 10 months ago
2008
Today's software systems communicate over the Internet using standard protocols that have been heavily scrutinized, providing some assurance of resistance to malicious attack...
NRHM
2008
14 years 10 months ago
2008
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
IPL
2007
14 years 10 months ago
2007
The online frequency allocation problem for cellular networks has been well studied in these years. Given a mobile telephone network, whose geographical coverage area is divided i...
JACM
1998
14 years 9 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...