2656 search results - page 225 / 532 » Compacting XML Data |
150
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
124
click to vote
FORTE
2001
15 years 5 months ago
2001
The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying ...
116
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
136
click to vote
COMPUTING
2006
15 years 4 months ago
2006
We study cubature formulas on relatively small scattered samples in the unit square, obtained by integrating radial basis function (RBF) interpolants. Numerical tests show that, d...
134
click to vote
TSP
2008
15 years 4 months ago
2008
Recently, new polynomial approximation formulas were proposed for the reconstruction of compactly supported piecewise smooth functions from Fourier data. Formulas for zero and firs...