Sciweavers

353 search results - page 56 / 71
» From graph states to two-graph states
Sort
View
NRHM
2008
106views more  NRHM 2008»
13 years 8 months ago
Towards the unification of formats for overlapping markup
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
Paolo Marinelli, Fabio Vitali, Stefano Zacchiroli
IJCV
2007
208views more  IJCV 2007»
13 years 8 months ago
Binet-Cauchy Kernels on Dynamical Systems and its Application to the Analysis of Dynamic Scenes
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
S. V. N. Vishwanathan, Alexander J. Smola, Ren&eac...
SPIN
2010
Springer
13 years 6 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
FGCS
2011
123views more  FGCS 2011»
13 years 3 months ago
Mapping attribution metadata to the Open Provenance Model
A description of a data item’s provenance can be provided in different forms, and which form is best depends on the intended use of that description. Because of this, differen...
Simon Miles
NHM
2010
87views more  NHM 2010»
13 years 2 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...