198 search results - page 4 / 40 » On Extremal Cases of Hopcroft's Algorithm |
HOTOS
1999
IEEE
13 years 11 months ago
1999
IEEE
Wide-area distributed applications are frequently limited by the performance of Internet data transfer. We argue that the principle cause of this effect is the poor interaction be...
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
DAGSTUHL
2004
13 years 8 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
DAGM
2008
Springer
13 years 9 months ago
2008
Springer
We introduce the OneClassMaxMinOver (OMMO) algorithm for the problem of one-class support vector classification. The algorithm is extremely simple and therefore a convenient choice...
ICCBR
2003
Springer
14 years 17 days ago
2003
Springer
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...