Sciweavers

3088 search results - page 334 / 618
» Online Passive-Aggressive Algorithms
Sort
View
BROADNETS
2004
IEEE
15 years 10 months ago
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
Fanchun Jin, Gokhan Sahin, Amrinder Arora, Hyeong-...
ICML
2008
IEEE
16 years 7 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
WWW
2008
ACM
16 years 7 months ago
Finding core members in virtual communities
Finding the core members of a virtual community is an important problem in community analysis. Here we presented an simulated annealing algorithm to solve this problem by optimizi...
Haiqiang Chen, Xueqi Cheng, Yue Liu
WWW
2010
ACM
16 years 1 months ago
Web-scale k-means clustering
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
D. Sculley
STACS
2009
Springer
16 years 1 months ago
Nonclairvoyant Speed Scaling for Flow and Energy
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P(s) = sα . We give a ...
Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei ...