5607 search results - page 283 / 1122 » Graph structure in the Web |
185
click to vote
CIKM
2005
Springer
16 years 6 days ago
2005
Springer
In this paper, we propose a versatile disambiguation approach which can be used to make explicit the meaning of structure based information such as XML schemas, XML document struc...
196
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
The Web is a dynamic, ever changing collection of information. This paper explores changes in Web content by analyzing a crawl of 55,000 Web pages, selected to represent different...
173
click to vote
ISAAC
2005
Springer
16 years 5 days ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
188
click to vote
IWPC
2000
IEEE
15 years 11 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
147
click to vote
UAI
2004
15 years 8 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...