Sciweavers

3088 search results - page 287 / 618
» Online Passive-Aggressive Algorithms
Sort
View
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 9 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
SIGCOMM
2012
ACM
13 years 9 months ago
Optimizing cost and performance for content multihoming
Many large content publishers use multiple content distribution networks to deliver their content, and many industrial systems have become available to help a broader set of conte...
Hongqiang Harry Liu, Ye Wang, Yang Richard Yang, H...
FOCS
2003
IEEE
15 years 12 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
NIPS
2004
15 years 8 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
FSTTCS
2004
Springer
16 years 1 days ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi