نتایج جستجو برای: decomposed

تعداد نتایج: 14070  

2013
Denis K. Ponomaryov Mikhail Soutchanski

In many tasks related to reasoning about consequences of a logical theory, it is desirable to decompose the theory into a number of components with weakly-related or independent signatures. This facilitates reasoning when the signature of a query formula belongs to only one of the components. However, an initial theory may be subject to change due to execution of actions affecting features ment...

2012
Rajhans Samdani Dan Roth

This supplement provides the proof for all the theorems and corollaries in the main paper. We provide the proofs as well as the theorem statements for the ease of understanding while borrowing the notation from the main draft. Proof. Assume that we are given an > 0 for which the condition mentioned in the theorem statement holds true (for the sake of simplicity we assume the same for all w ∈ R ...

2016
H. M. W. Verbeek

In the area of process mining, decomposed replay has been proposed to be able to deal with nets and logs containing many different activities. The main assumption behind this decomposition is that replaying many subnets and sublogs containing only some activities is faster then replaying a single net and log containing many activities. Although for many nets and logs this assumption does hold, ...

Journal: :Inf. Syst. 2014
Jorge Munoz-Gama Josep Carmona Wil M. P. van der Aalst

An exponential growth of event data can be witnessed across all industries. Devices connected to the internet (internet of things), social interaction, mobile computing, and cloud computing provide new sources of event data and this trend will continue. The omnipresence of large amounts of event data is an important enabler for process mining. Process mining techniques can be used to discover, ...

Journal: :CoRR 2012
Rajhans Samdani Dan Roth

Structured prediction is the cornerstone of several machine learning applications. Unfortunately, in structured prediction settings with expressive inter-variable interactions, exact inference-based learning algorithms, e.g. Structural SVM, are often intractable. We present a new way, Decomposed Learning (DecL), which performs efficient learning by restricting the inference step to a limited pa...

Journal: :Inf. Syst. 1999
Arthur J. Bernstein David Scott Gerstl Philip M. Lewis

A number of authors have proposed methods for increasing the throughput of transaction processing systems by decomposing transactions into steps and allowing the steps of concurrently executing transactions to be interleaved. In some proposals all interleavings are assumed to be acceptable, while in others certain interleavings are forbidden. In this paper we describe a new concurrency control ...

2014
H. M. W. Verbeek Wil M. P. van der Aalst

Over the last decade process mining techniques have matured and more and more organizations started to use process mining to analyze their operational processes. The current hype around “big data” illustrates the desire to analyze ever-growing data sets. Process mining starts from event logs—multisets of traces (sequences of events)—and for the widespread application of process mining it is vit...

Journal: :Computers & Mathematics with Applications 1990

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید