5153 search results - page 502 / 1031 » Introduction to Randomized Algorithms |
190
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
213
click to vote
TMC
2012
13 years 9 months ago
2012
—3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communicatio...
242
click to vote
JMLR
2012
13 years 9 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
254
click to vote
JMLR
2012
13 years 9 months ago
2012
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
196
click to vote
JMLR
2012
13 years 9 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...