8540 search results - page 374 / 1708 » The Dynamic Servers Problem |
154
click to vote
MIDDLEWARE
2007
Springer
15 years 10 months ago
2007
Springer
Although there is a large body of research on detection and prevention of such memory corruption attacks as buffer overflow, integer overflow, and format string attacks, the web...
148
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
167
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...
270
click to vote
STOC
2012
ACM
13 years 7 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
142
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...