Sciweavers

2916 search results - page 135 / 584
» Generating Rule Sets from Model Trees
Sort
View
JAR
2010
98views more  JAR 2010»
14 years 11 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 8 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
LREC
2008
175views Education» more  LREC 2008»
15 years 5 months ago
Arabic WordNet: Semi-automatic Extensions using Bayesian Inference
This presentation focuses on the semi-automatic extension of Arabic WordNet (AWN) using lexical and morphological rules and applying Bayesian inference. We briefly report on the c...
Horacio Rodríguez, David Farwell, Javi Ferr...
CVPR
2011
IEEE
14 years 11 months ago
Random Field Topic Model for Semantic Region Analysis in Crowded Scenes from Tracklets
In this paper, a Random Field Topic (RFT) model is proposed for semantic region analysis from motions of objects in crowded scenes. Different from existing approaches of learning ...
Bolei Zhou, Xiaogang Wang
ENTCS
2007
126views more  ENTCS 2007»
15 years 4 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari