Sciweavers

36 search results - page 4 / 8
» Decidable Approximations of Sets of Descendants and Sets of ...
Sort
View
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
13 years 11 months ago
A Solution to the Extended GCD Problem
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
Bohdan S. Majewski, George Havas
ICONIP
2004
13 years 9 months ago
An Auxiliary Variational Method
Variational methods have proved popular and effective for inference and learning in intractable graphical models. An attractive feature of the approaches based on the Kullback-Lei...
Felix V. Agakov, David Barber
APN
2010
Springer
13 years 7 months ago
Forward Analysis for Petri Nets with Name Creation
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
Fernando Rosa Velardo, David de Frutos-Escrig
CLUSTER
2008
IEEE
13 years 9 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
FSTTCS
2010
Springer
13 years 5 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...