Sciweavers

1062 search results - page 172 / 213
» Sublinear Optimization for Machine Learning
Sort
View
COMBINATORICA
2010
13 years 6 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
COMBINATORICA
2010
13 years 4 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
ICC
2007
IEEE
141views Communications» more  ICC 2007»
14 years 3 months ago
Accurate Classification of the Internet Traffic Based on the SVM Method
—The need to quickly and accurately classify Internet traffic for security and QoS control has been increasing significantly with the growing Internet traffic and applications ov...
Zhu Li, Ruixi Yuan, Xiaohong Guan
CHI
2006
ACM
14 years 9 months ago
groupTime: preference based group scheduling
As our business, academic, and personal lives continue to move at an ever-faster pace, finding times for busy people to meet has become an art. One of the most perplexing challeng...
Mike Brzozowski, Kendra Carattini, Scott R. Klemme...
COLT
2008
Springer
13 years 10 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal