Sciweavers

4972 search results - page 250 / 995
» Ranking on graph data
Sort
View
IPPS
2006
IEEE
16 years 21 days ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
16 years 5 days ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
KDD
2009
ACM
172views Data Mining» more  KDD 2009»
15 years 11 months ago
Learning dynamic temporal graphs for oil-production equipment monitoring system
Learning temporal graph structures from time series data reveals important dependency relationships between current observations and histories. Most previous work focuses on learn...
Yan Liu, Jayant R. Kalagnanam, Oivind Johnsen
ESWS
2007
Springer
15 years 10 months ago
Functional Programs as Linked Data
The idea of linked programs, or procedural RDF metadata, has not been deeply explored. This paper introduces a dedicated scripting language for linked data, called Ripple, whose pr...
Joshua Shinavier
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
16 years 24 days ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan