2004 search results - page 9 / 401 » Sampling from large graphs |
113
Voted
ICS
1993
Tsinghua U.
15 years 3 months ago
1993
Tsinghua U.
Performance monitoring of large scale parallel computers creates a dilemma: we need to collect detailed information to find performance bottlenecks, yet collecting all this data ...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
The problem attempted in this paper is to select a sample from a large set where the sample is required to have a particular average property. The problem can be expressed as an o...
ISAAC
1998
Springer
15 years 3 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
112
Voted
EDBT
2012
ACM
13 years 2 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
ICPR
2008
IEEE
16 years 26 days ago
2008
IEEE
This paper presents a framework to synthesize large realistic iris databases, providing an alternative to iris database collection. Firstly, iris patch is used as a basic element ...