5153 search results - page 505 / 1031 » Introduction to Randomized Algorithms |
145
click to vote
ICDM
2007
IEEE
16 years 25 days ago
2007
IEEE
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
201
Voted
NAS
2007
IEEE
16 years 23 days ago
2007
IEEE
In cluster-based storage systems, the metadata server cluster must be able to adaptively distribute responsibility for metadata to maintain high system performance and long-term l...
162
click to vote
GCC
2005
Springer
16 years 20 hour ago
2005
Springer
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
168
click to vote
ISAAC
2005
Springer
16 years 6 hour ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
164
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...