2168 search results - page 199 / 434 » Randomized Algorithms and Complexity Theory |
132
Voted
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
191
Voted
VLDB
2005
ACM
16 years 3 months ago
2005
ACM
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
110
Voted
DAGSTUHL
2006
15 years 5 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
140
Voted
ICCAD
2002
IEEE
16 years 16 days ago
2002
IEEE
Voltage scheduling is indispensable for exploiting the benefit of variable voltage processors. Though extensive research has been done in this area, current processor limitations...
119
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...