8540 search results - page 1408 / 1708 » The Dynamic Servers Problem |
144
click to vote
DOLAP
2003
ACM
15 years 9 months ago
2003
ACM
Motivated by the need for more flexible OLAP systems, this paper presents work on logical integration of external data in OLAP databases, carried out in cooperation between the D...
142
click to vote
DSOM
2003
Springer
15 years 9 months ago
2003
Springer
TrustedFlow™ is a software solution to the problem of remotely authenticating code during execution. A continuous flow of idiosyncratic signatures assures that the software from ...
124
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
177
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
141
click to vote
ICNP
2002
IEEE
15 years 9 months ago
2002
IEEE
We advocate the notion of service overlay network (SON) as an effective means to address some of the issues, in particular, end-to-end QoS, plaguing the current Internet, and to f...