Sciweavers

2005 search results - page 45 / 401
» On the Camera Placement Problem
Sort
View
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
13 years 11 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
IPPS
2007
IEEE
14 years 2 months ago
Implementing Replica Placements: Feasibility and Cost Minimization
Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...
Thanasis Loukopoulos, Nikos Tziritas, Petros Lamps...
GLOBECOM
2007
IEEE
14 years 2 months ago
Clustered K-Center: Effective Replica Placement in Peer-to-Peer Systems
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
Jian Zhou, Xin Zhang, Laxmi N. Bhuyan, Bin Liu
TMC
2010
100views more  TMC 2010»
13 years 6 months ago
Optimal Relay Station Placement in Broadband Wireless Access Networks
—To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we s...
Bin Lin, Pin-Han Ho, Liang-Liang Xie, Xuemin (Sher...
TON
2010
197views more  TON 2010»
13 years 6 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...