158
click to vote
ISAAC
15 years 10 months ago
2005 Springer 
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
118
Voted
ISAAC
15 years 10 months ago
2005 Springer  128
Voted
ISAAC
15 years 10 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 ,...
168
Voted
ISAAC
15 years 10 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...
151
click to vote
ISAAC
15 years 10 months ago
2005 Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
|
Algorithms