Sciweavers

207 search results - page 16 / 42
» Powers of cycles, powers of paths, and distance graphs
Sort
View
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 21 days ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
WCNC
2008
IEEE
14 years 2 months ago
Novel Ultra Wideband Low Complexity Ranging Using Different Channel Statistics
—UWB technology can reach centimetre level ranging and positioning accuracy in LOS propagation when time of arrival techniques are used. However, in a real positioning system, th...
Giovanni Bellusci, Gerard J. M. Janssen, Junlin Ya...
PR
2011
13 years 2 months ago
A sum-over-paths extension of edit distances accounting for all sequence alignments
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
Silvia García-Díez, François ...
MLQ
1998
126views more  MLQ 1998»
13 years 7 months ago
Reverse Mathematics and Recursive Graph Theory
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
William I. Gasarch, Jeffry L. Hirst
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 9 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau