198 search results - page 3 / 40 » On Extremal Cases of Hopcroft's Algorithm |
WAW
2007
Springer
13 years 12 months ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
TRIDENTCOM
2008
IEEE
14 years 3 days ago
2008
IEEE
Several difficulties arise when testing network security algorithms. First, using network data captured at a router does not guarantee that any instances of the security event of...
AI
2001
Springer
13 years 10 months ago
2001
Springer
We present our experience in applying a rule induction technique to an extremely imbalanced pharmaceutical data set. We focus on using a variety of performance measures to evaluate...
IOR
2010
13 years 3 months ago
2010
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
AAAI
1994
13 years 7 months ago
1994
This paper presents an algorithm, called JustIn-Case Scheduling, for building robust schedules that tend not to break. The algorithm implements the common sense idea of being prep...