Searching for authors named "Aris Anagnostopoulos" – sorted by Relevance.
-
Stability and Efficiency of a Random Local Load Balancing Protocol
- We study the long term (steady state) performance of a simple, randomized, local load balancing technique. We assume a system of n processors connected by an arbitrary network topology. Jobs are placed in the processors by a deterministic or randomized adversary. The adversary knows the current and
- Cited by 5 (2 self) – Add To MetaCart
-
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input
- We study the long-term (steady state) performance of a simple, randomized, local load balancing technique under a broad range of input conditions. We assume a system of n processors connected by an arbitrary network topology. Jobs are placed in the processors by a deterministic or randomized adversa
- Cited by 6 (2 self) – Add To MetaCart
-
Steady state analysis of balanced-allocation routing. Random Structures and Algorithms
- We compare the long-term, steady-state performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks, to the performance of a path-selection algorithm based on the “balanced-allocation ” principle [3, 16]; we refer to this new algori
- Cited by 1 (1 self) – Add To MetaCart
-
Effective and efficient classification on a search-engine model
- Traditional document classification frameworks, which apply the learned classifier to each document in a corpus one by one, are infeasible for extremely large document corpora, like the Web or large corporate intranets. We consider the classification problem on a corpus that has been processed prima
- Cited by 1 (1 self) – Add To MetaCart
-
Persistent Authenticated Dictionaries and Their Applications
- that arise in the implementation of the hash trees, leading to easier and less error-prone implementations
- Cited by 34 (14 self) – Add To MetaCart
-
Sampling Search-Engine Results
- . An initial problem arises from the fact that although we may know how many documents contain the term A
- Cited by 14 (3 self) – Add To MetaCart
-
A Simple and Deterministic Competitive Algorithm for Online Facility Location
- problems arise in a variety of telecommunication, networking, and mobile computing applications
- Cited by 1 (0 self) – Add To MetaCart
-
Global distancebased segmentation of trajectories
- This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primitives that are better suited for storage and retrieval purposes. Previous work on trajectory segmentation attacked the pr
- Cited by 3 (1 self) – Add To MetaCart
-
Finding ’who is talking to whom’ in voip networks via progressive stream clustering
- Technologies that use the Internet network to deliver voice communications have the potential to reduce costs and improve access to communications services around the world. However, these new technologies pose several challenges in terms of confidentiality of the conversations and anonymity of the
- Cited by 1 (0 self) – Add To MetaCart
-
Steady State Analysis of Balanced-Allocation Routing
- We compare the long-term, steady-state performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks, to the performance of a path-selection algorithm based on the "balanced-allocation" principle [Y. Azer, A. Z. Broder, A. R. Karlin
- Add To MetaCart

