Sciweavers

128 search results - page 15 / 26
» Lower bounds for adaptive collect and related objects
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
Estimators also need shared values to grow together
—Network management applications require large numbers of counters in order to collect traffic characteristics for each network flow. However, these counters often barely fit ...
Erez Tsidon, Iddo Hanniel, Isaac Keslassy
ML
2012
ACM
385views Machine Learning» more  ML 2012»
12 years 3 months ago
An alternative view of variational Bayes and asymptotic approximations of free energy
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
Kazuho Watanabe
INFOCOM
2003
IEEE
14 years 25 days ago
Power Constrained and Delay Optimal Policies for Scheduling Transmission over a Fading Channel
ACT We consider an optimal power and rate scheduling problem for a single user transmitting to a base station on a fading wireless link with the objective of minimizing the mean de...
Munish Goyal, Anurag Kumar, Vinod Sharma
RTSS
2000
IEEE
13 years 12 months ago
A User-Customizable Energy-Adaptive Combined Static/Dynamic Scheduler for Mobile Applications
In portable applications, the energy consumed by OS and application tasks primarily comes from DC battery source, which is limited and imposes an upper bound to the amount of time...
Trolan C. L. Ma, Kang G. Shin
ANOR
2011
117views more  ANOR 2011»
12 years 11 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover