Sciweavers

3147 search results - page 241 / 630
» Distributed averaging in dynamic networks
Sort
View
SIGIR
2009
ACM
16 years 1 months ago
Dynamicity vs. effectiveness: studying online clustering for scatter/gather
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
Weimao Ke, Cassidy R. Sugimoto, Javed Mostafa
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 12 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
EUROPAR
2009
Springer
15 years 10 months ago
Dynamic Virtual Cluster Reconfiguration for Efficient IaaS Provisioning
Abstract. Cloud computing is an emerging paradigm to provide Infrastructure as a Service (IaaS). In this paper we present NEPTUNE-IaaS, a software system able to support the whole ...
Vittorio Manetti, Pasquale Di Gennaro, Roberto Bif...
FOCS
1997
IEEE
15 years 10 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
ACMSE
1995
ACM
15 years 10 months ago
Database management for multimedia distributed collaborative writing
{ Traditional computer applications have been designed to be run by one user at a time who does some work in a single medium, such as ASCII text, and very little regard has been gi...
A. Wesley Wear, Yu Gong, Kai H. Chang