Sciweavers

298 search results - page 16 / 60
» Competitive Analysis of Flash-Memory Algorithms
Sort
View
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
15 years 10 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
INFOCOM
2005
IEEE
15 years 3 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
CLEF
2010
Springer
14 years 8 months ago
University of Sheffield - Lab Report for PAN at CLEF 2010
Abstract This paper describes the University of Sheffield entry for the 2nd international plagiarism detection competition (PAN 2010). Our system attempts to identify extrinsic pla...
Rao Muhammad Adeel Nawab, Mark Stevenson, Paul Clo...
NIPS
2004
14 years 11 months ago
Online Bounds for Bayesian Algorithms
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...
Sham M. Kakade, Andrew Y. Ng
SPAA
2004
ACM
15 years 3 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén