Sciweavers

258 search results - page 45 / 52
» Relational Correspondences for Lattices with Operators
Sort
View
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 7 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
SIGMOD
2008
ACM
95views Database» more  SIGMOD 2008»
14 years 7 months ago
Interactive generation of integrated schemas
Schema integration is the problem of creating a unified target schema based on a set of existing source schemas that relate to each other via specified correspondences. The unifie...
Laura Chiticariu, Phokion G. Kolaitis, Lucian Popa
TMI
2008
92views more  TMI 2008»
13 years 7 months ago
Using Perturbation Theory to Compute the Morphological Similarity of Diffusion Tensors
Computing the morphological similarity of diffusion tensors (DTs) at neighboring voxels within a DT image, or at corresponding locations across different DT images, is a fundamenta...
Ravi Bansal, Lawrence H. Staib, Dongrong Xu, Andre...
WWW
2005
ACM
14 years 8 months ago
Web-assisted annotation, semantic indexing and search of television and radio news
The Rich News system, that can automatically annotate radio and television news with the aid of resources retrieved from the World Wide Web, is described. Automatic speech recogni...
Mike Dowman, Valentin Tablan, Hamish Cunningham, B...
POPL
2008
ACM
14 years 7 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...