Sciweavers

2095 search results - page 141 / 419
» Improved pebbling bounds
Sort
View
COLT
2010
Springer
15 years 4 months ago
Robust Selective Sampling from Single and Multiple Teachers
We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of ou...
Ofer Dekel, Claudio Gentile, Karthik Sridharan
GLOBECOM
2010
IEEE
15 years 3 months ago
Multicast Advance Reservation RWA Heuristics in Wavelength-Routed Networks
In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Advance reservation connection requests specify ...
Neal Charbonneau, Vinod Vokkarane
CORR
2012
Springer
228views Education» more  CORR 2012»
14 years 2 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
CORR
2007
Springer
115views Education» more  CORR 2007»
15 years 6 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav
HPDC
2011
IEEE
14 years 10 months ago
Juggle: proactive load balancing on multicore computers
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...
Steven Hofmeyr, Juan A. Colmenares, Costin Iancu, ...