1542 search results - page 205 / 309 » The metamathematics of random graphs |
104
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
119
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
103
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
132
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
125
click to vote
FUIN
2008
15 years 1 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...