Sciweavers

199 search results - page 4 / 40
» A large time-aware web graph
Sort
View
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 28 days ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
SEMWEB
2010
Springer
13 years 5 months ago
Compact Representation of Large RDF Data Sets for Publishing and Exchange
Abstract. Increasingly huge RDF data sets are being published on the Web. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisi...
Javier D. Fernández, Miguel A. Martí...
ICCTA
2007
IEEE
13 years 11 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 1 months ago
Finding Thai Web Pages in Foreign Web Spaces
While the Web has been increasingly recognized as a culturally valuable social artifact, many nations endeavor to create national Web archives for long term preservation. However, ...
Kulwadee Somboonviwat, Takayuki Tamura, Masaru Kit...
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
14 years 8 days ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang