Sciweavers

147 search results - page 6 / 30
» Parallel Query Processing and Edge Ranking of Graphs
Sort
View
WEA
2010
Springer
245views Algorithms» more  WEA 2010»
15 years 4 months ago
Contraction of Timetable Networks with Realistic Transfers
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
Robert Geisberger
CW
2005
IEEE
15 years 3 months ago
ComRank: Metasearch and Automatic Ranking of XML Retrieval System
Different information retrieval (IR) systems often return very diverse results lists for the same query. This is problematic for users since no one IR system works best for every ...
Alan Woodley, Shlomo Geva
88
Voted
ML
2010
ACM
141views Machine Learning» more  ML 2010»
14 years 7 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
GG
2004
Springer
15 years 2 months ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
15 years 3 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...