2004 search results - page 176 / 401 » Sampling from large graphs |
153
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
149
click to vote
BIOCOMP
2008
15 years 4 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
182
Voted
DEBU
2010
15 years 3 months ago
2010
The proliferation of knowledge-sharing communities like Wikipedia and the advances in automated information extraction from Web pages enable the construction of large knowledge ba...
120
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
152
click to vote
TCAD
2008
15 years 3 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...