243 search results - page 30 / 49 » On Balanced Graphs |
108
click to vote
PVLDB
2010
14 years 4 months ago
2010
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
IPL
2008
14 years 9 months ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
55
Voted
INFOCOM
1993
IEEE
15 years 1 months ago
1993
IEEE
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
RIVF
2003
14 years 11 months ago
2003
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...