Sciweavers

280 search results - page 33 / 56
» Distributed Approximation Algorithms for Planar Graphs
Sort
View
CORR
2008
Springer
179views Education» more  CORR 2008»
14 years 9 months ago
Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...
Soummya Kar, José M. F. Moura, Kavita Raman...
82
Voted
ATAL
2011
Springer
13 years 9 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...
SC
1995
ACM
15 years 1 months ago
Analysis of Multilevel Graph Partitioning
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
George Karypis, Vipin Kumar
SPAA
2004
ACM
15 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
74
Voted
IPPS
2005
IEEE
15 years 3 months ago
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
Jan-Jan Wu, Pangfeng Liu