59
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
56
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
125
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
53
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
61
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
91
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
113
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
84
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...