Sciweavers

8540 search results - page 1649 / 1708
» The Dynamic Servers Problem
Sort
View
SSDBM
2005
IEEE
159views Database» more  SSDBM 2005»
15 years 3 months ago
Clustering Moving Objects via Medoid Clusterings
Modern geographic information systems do not only have to handle static information but also dynamically moving objects. Clustering algorithms for these moving objects provide new...
Hans-Peter Kriegel, Martin Pfeifle
SSDBM
2005
IEEE
132views Database» more  SSDBM 2005»
15 years 3 months ago
Co-Scheduling of Computation and Data on Computer Clusters
Scientific investigations have to deal with rapidly growing amounts of data from simulations and experiments. During data analysis, scientists typically want to extract subsets o...
Alexandru Romosan, Doron Rotem, Arie Shoshani, Der...
ANCS
2005
ACM
15 years 3 months ago
Framework for supporting multi-service edge packet processing on network processors
Network edge packet-processing systems, as are commonly implemented on network processor platforms, are increasingly required to support a rich set of services. These multi-servic...
Arun Raghunath, Aaron R. Kunze, Erik J. Johnson, V...
IMC
2005
ACM
15 years 3 months ago
The Power of Slicing in Internet Flow Measurement
Flow measurement evolved into the primary method for measuring the composition of Internet traffic. Large ISPs and small networks use it to track dominant applications, dominant ...
Ramana Rao Kompella, Cristian Estan
PODC
2005
ACM
15 years 3 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
« Prev « First page 1649 / 1708 Last » Next »