Sciweavers

697 search results - page 4 / 140
» Decomposition Structures for Event-B
Sort
View
INFORMATICALT
2007
80views more  INFORMATICALT 2007»
13 years 7 months ago
Recognition Algorithm for Diamond-Free Graphs
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
Mihai Talmaciu, Elena Nechita
ACL
2011
12 years 11 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez
BPM
2008
Springer
155views Business» more  BPM 2008»
13 years 9 months ago
The Refined Process Structure Tree
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
Jussi Vanhatalo, Hagen Völzer, Jana Koehler
ICDE
2012
IEEE
202views Database» more  ICDE 2012»
11 years 9 months ago
Differentially Private Spatial Decompositions
— Differential privacy has recently emerged as the de facto standard for private data release. This makes it possible to provide strong theoretical guarantees on the privacy and ...
Graham Cormode, Cecilia M. Procopiuc, Divesh Sriva...
PAMI
2011
12 years 10 months ago
Decomposition of Complex Line Drawings with Hidden Lines for 3D Planar-Faced Manifold Object Reconstruction
—3D object reconstruction from a single 2D line drawing is an important problem in computer vision. Many methods have been presented to solve this problem, but they usually fail ...
Jianzhuang Liu, Yu Chen, Xiaoou Tang