Results 11  20
of
350
Adaptive Server Selection for Large Scale Interactive Online Games
 ACM Int’l Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV
, 2004
"... In this paper, we present a novel distributed algorithm that dynamically selects game servers for a group of game clients participating in large scale interactive online games. The goal of server selection is to minimize server resource usage while satisfying the realtime delay constraint. We devel ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
In this paper, we present a novel distributed algorithm that dynamically selects game servers for a group of game clients participating in large scale interactive online games. The goal of server selection is to minimize server resource usage while satisfying the realtime delay constraint. We develop a synchronization delay model for interactive games and formulate the server selection problem, and prove that the considered problem is NPhard. The proposed algorithm, called zoominzoomout, is adaptive to session dynamics (e.g. clients join and leave) and lets the clients select appropriate servers in a distributed manner such that the number of servers used by the game session is minimized. Using simulation, we present the performance of the proposed algorithm and show that it is simple yet effective in achieving its design goal. In particular, we show that the performance of our algorithm is comparable to that of a greedy selection algorithm, which requires global information and excessive computation.
Parameterized complexity of generalized vertex cover problems
 In Proc. 9th WADS, volume 3608 of LNCS
, 2005
"... Abstract. Important generalizations of the Vertex Cover problem ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
Abstract. Important generalizations of the Vertex Cover problem
Pattern matching in polyphonic music as a weighted geometric translation problem
 In Proc. 5th International Conference on Music Information Retrieval
, 2004
"... We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a problem of translating a set of horizontal line segments in the plane to find the best match in a larger set of horizontal line segme ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a problem of translating a set of horizontal line segments in the plane to find the best match in a larger set of horizontal line segments. Our contribution is that we use fairly general weight functions to measure the quality of a match, thus enabling approximate pattern matching. We give an algorithm with running time O(nm log m), where n is the size of the score and m is the size of the pattern. We show that the problem, in this geometric formulation, is unlikely to have a significantly faster algorithm because it is at least as hard as a basic problem called 3SUM that is conjectured to have no subquadratic algorithm. We present some examples to show the potential of this method for finding minor variations of a theme, and for finding polyphonic musical patterns in a polyphonic score. 1.
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks
 Mobile Networks and Applications (MONET), Special Issue on Energy Constraints and Lifetime Performance in Wireless Sensor Networks
, 2005
"... Abstract — We investigate the problem of energyefficient broadcast routing over stationary wireless adhoc networks where the host is not mobile. We define the lifetime of a network as the duration of time from the network initialization until the first node failure due to the battery exhaustion. We ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
Abstract — We investigate the problem of energyefficient broadcast routing over stationary wireless adhoc networks where the host is not mobile. We define the lifetime of a network as the duration of time from the network initialization until the first node failure due to the battery exhaustion. We provide a globally optimal solution to the problem of maximizing a static network lifetime through a graph theoretic approach. We make use of this solution to develop a periodic tree update strategy for dynamic load balancing and show that a significant gain in network lifetime can be achieved. We also provide extensive comparative simulation studies on parameters that affect the lifetime of a network. I.
On the Optimization of Storage Capacity Allocation for Content Distribution
 Computer Networks
, 2003
"... The addition of storage capacity in network nodes for the caching or replication of popular data objects results in reduced enduser delay, reduced network tra#c, and improved scalability. ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
The addition of storage capacity in network nodes for the caching or replication of popular data objects results in reduced enduser delay, reduced network tra#c, and improved scalability.
Competitive collaborative learning
 In Proceedings of the 18th Annual Conference on Learning Theory (COLT
, 2005
"... Abstract. We develop algorithms for a community of users to make decisions about selecting products or resources, in a model characterized by two key features: – The quality of the products or resources may vary over time. – Some of the users in the system may be dishonest, manipulating their action ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
Abstract. We develop algorithms for a community of users to make decisions about selecting products or resources, in a model characterized by two key features: – The quality of the products or resources may vary over time. – Some of the users in the system may be dishonest, manipulating their actions in a Byzantine manner to achieve other goals. We formulate such learning tasks as an algorithmic problem based on the multiarmed bandit problem, but with a set of users (as opposed to a single user), of whom a constant fraction are honest and are partitioned into coalitions such that the users in a coalition perceive the same expected quality if they sample the same resource at the same time. Our main result exhibits an algorithm for this problem which converges in polylogarithmic time to a state in which the average regret (per honest user) is an arbitrarily small constant. 1
Topology Control in Ad hoc Wireless Networks with Hitchhiking
, 2004
"... In this paper, we address the Topology Control with Hitchhiking (TCH) problem. Hitchhiking [1] is a novel model introduced recently that allows combining partial messages to decode a complete message. By effective use of partial signals, a specific topology can be obtained with less transmission ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
In this paper, we address the Topology Control with Hitchhiking (TCH) problem. Hitchhiking [1] is a novel model introduced recently that allows combining partial messages to decode a complete message. By effective use of partial signals, a specific topology can be obtained with less transmission power. The objective of the TCH problem is to obtain a stronglyconnected topology with minimum total energy consumption. We prove the TCH problem to be NPcomplete and design a distributed and localized algorithm (DTCH) that can be applied on top of any symmetric, stronglyconnected topology to reduce total power consumption. We analyze the performance of our approach through simulation.
1 Multithreaded Asynchronous Graph Traversal for InMemory and SemiExternal Memory
"... Abstract—Processing large graphs is becoming increasingly important for many computational domains. Unfortunately, many algorithms and implementations do not scale with the demand for increasing graph sizes. As a result, researchers have attempted to meet the growing data demands using parallel and ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Abstract—Processing large graphs is becoming increasingly important for many computational domains. Unfortunately, many algorithms and implementations do not scale with the demand for increasing graph sizes. As a result, researchers have attempted to meet the growing data demands using parallel and external memory techniques. Our work, targeted to chip multiprocessors, takes a highly parallel asynchronous approach to hide the high data latency due to both poor locality and delays in the underlying graph data storage. We present a novel asynchronous approach to compute Breadth First Search (BFS), Single Source Shortest Path (SSSP), and Connected Components (CC) for large graphs in shared memory. We present an experimental study applying our technique to both InMemory (IM) and SemiExternal Memory (SEM) graphs utilizing multicore processors and solidstate memory devices. Our experiments using both synthetic and realworld datasets show that our asynchronous approach is able to overcome data latencies and provide significant speedup over alternative approaches. I.
SpaceEfficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time
"... We present spaceefficient algorithms for computing the convex hull of a simple polygonal line inplace, in linear time. It turns out that the problem is as hard as stable partition, i.e., if there were a truly simple solution then stable partition would also have a truly simple solution, and vice v ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
We present spaceefficient algorithms for computing the convex hull of a simple polygonal line inplace, in linear time. It turns out that the problem is as hard as stable partition, i.e., if there were a truly simple solution then stable partition would also have a truly simple solution, and vice versa. Nevertheless, we present a simple selfcontained solution that uses O(log n) space, and indicate how to improve it to O(1) space with the same techniques used for stable partition. If the points inside the convex hull can be discarded, then there is a truly simple solution that uses a single call to stable partition, and even that call can be spared if only extreme points are desired (and not their order). If the polygonal line is closed, then the problem admits a very simple solution which does not call for stable partitioning at all.
Syntactic analysis by local grammars and automata: an efficient algorithm
 In Proceedings of the International Conference on Computational Lexicography (COMPLEX 94
, 1994
"... address: ..."