Sciweavers

199 search results - page 32 / 40
» A large time-aware web graph
Sort
View
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
14 years 1 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
WISE
2002
Springer
14 years 11 days ago
Cluster-Based Delta Compression of a Collection of Files
Delta compression techniques are commonly used to succinctly represent an updated version of a file with respect to an earlier one. In this paper, we study the use of delta compr...
Zan Ouyang, Nasir D. Memon, Torsten Suel, Dimitre ...
JDA
2006
184views more  JDA 2006»
13 years 7 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
JUCS
2010
179views more  JUCS 2010»
13 years 5 months ago
Ontology Visualization: Tools and Techniques for Visual Representation of Semi-Structured Meta-Data
: Ontologies are used to represent a variety of domain knowledge and data collections, scopes, viewpoints and linked heterogeneous information sources. They range from simple topol...
Monika Lanzenberger, Jennifer Sampson, Markus Rest...
SEMWEB
2009
Springer
14 years 2 months ago
Functions over RDF Language Elements
Spreadsheet tools are often used in business and private scenarios in order to collect and store data, and to explore and analyze these data by executing functions and aggregation...
Bernhard Schandl