2004 search results - page 154 / 401 » Sampling from large graphs |
147
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
105
Voted
ECOOP
2006
Springer
15 years 7 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
203
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
139
click to vote
FUIN
2008
15 years 3 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
129
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...