1221 search results - page 199 / 245 » Balanced graph partitioning |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
MSR
2005
ACM
14 years 1 months ago
2005
ACM
Since code revisions reflect the extent of human involvement in the software development process, revision histories reveal the interactions and interfaces between developers and...
IPPS
2002
IEEE
14 years 18 days ago
2002
IEEE
: A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several s...
SIGMOD
2010
ACM
14 years 15 days ago
2010
ACM
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...