688 search results - page 41 / 138 » General Partitioning on Random Graphs |
116
click to vote
HT
2010
ACM
15 years 2 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
123
Voted
ML
2010
ACM
14 years 11 months ago
2010
ACM
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
102
Voted
DASFAA
2009
IEEE
15 years 4 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
103
click to vote
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
WSC
1997
15 years 1 months ago
1997
In recent articles we presented a general methodology for finite optimization. The new method, the Nested Partitions (NP) method, combines partitioning, random sampling, a select...