Sciweavers

9405 search results - page 244 / 1881
» Computing a Model of Set Theory
Sort
View
JCSC
1998
227views more  JCSC 1998»
15 years 4 months ago
Continuous and Hybrid Petri Nets
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
Hassane Alla, René David
132
Voted
ASP
2001
Springer
15 years 9 months ago
Useful Transformations in Answer set programming
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
Mauricio Osorio, Juan Carlos Nieves, Chris Giannel...
ICPR
2002
IEEE
16 years 5 months ago
Incorporating Conditional Independence Assumption with Support Vector Machines to Enhance Handwritten Character Segmentation Per
Learning Bayesian Belief Networks (BBN) from corpora and incorporating the extracted inferring knowledge with a Support Vector Machines (SVM) classifier has been applied to charac...
Manolis Maragoudakis, Ergina Kavallieratou, Nikos ...
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
16 years 1 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 4 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender