2137 search results - page 252 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
161
click to vote
FOCS
2006
IEEE
16 years 11 days ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
154
click to vote
JUCS
2007
15 years 6 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
168
click to vote
ALGOSENSORS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
168
click to vote
IJAR
2006
15 years 6 months ago
2006
In this paper we present a multi-scale method based on the hybrid notion of rough fuzzy sets, coming from the combination of two models of uncertainty like vagueness by handling r...
144
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...