Sciweavers

1089 search results - page 172 / 218
» Bounds on generalized Frobenius numbers
Sort
View
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
15 years 3 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
15 years 3 months ago
A plant location guide for the unsure
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
SIROCCO
2007
15 years 3 months ago
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions
Abstract. The problem we consider originates from the design of efficient on-board networks in satellites (also called Traveling Wave Tube Amplifiers). Signals incoming in the net...
Jean-Claude Bermond, Frédéric Giroir...
DAGSTUHL
2006
15 years 3 months ago
The optimal sequence compression
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
Alexander E. Andreev
ALT
2010
Springer
15 years 2 months ago
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
Thorsten Doliwa, Hans-Ulrich Simon, Sandra Zilles