2566 search results - page 102 / 514 » The Online Median Problem |
125
Voted
CSR
2010
Springer
15 years 5 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
102
click to vote
ISI
2008
Springer
15 years 23 days ago
2008
Springer
In this paper, we study the problem of anomaly detection in high-dimensional network streams. We have developed a new technique, called Stream Projected Ouliter deTector (SPOT), t...
86
Voted
ISAAC
1999
Springer
15 years 5 months ago
1999
Springer
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that bot...
111
Voted
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
Although widely studied for many years, colour quantisation remains a practical problem in image processing. Unlike previous works where the image can only be quantised after the ...
71
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
We investigate a natural online version of the well-known Maximum Directed Cut problem on DAGs. We propose a deterministic algorithm and show that it achieves a competitive ratio o...