Sciweavers

3105 search results - page 406 / 621
» The Path-Packing Structure of Graphs
Sort
View
WWW
2007
ACM
16 years 4 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
WWW
2005
ACM
16 years 4 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 4 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
FOCS
2008
IEEE
15 years 10 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
ICSM
2005
IEEE
15 years 9 months ago
Co-Change Visualization
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
Dirk Beyer