Sciweavers

877 search results - page 44 / 176
» How to Cover a Grammar
Sort
View
FINTAL
2006
15 years 4 months ago
Coordination Structures in a Typed Feature Structure Grammar: Formalization and Implementation
Abstract. Every language employs its own coordination strategies, according to the type of coordinating marking, the pattern of marking, the position of the marker, and the phrase ...
Jong-Bok Kim, Jaehyung Yang
97
Voted
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 7 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
90
Voted
MOR
2002
102views more  MOR 2002»
15 years 8 days ago
Facets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
Ismael R. de Farias Jr., Ellis L. Johnson, George ...
125
Voted
LICS
1991
IEEE
15 years 4 months ago
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
Hans Hüttel, Colin Stirling
ICSM
1999
IEEE
15 years 4 months ago
Building Documentation Generators
In order to maintain the consistency between sources and documentation, while at the same time providing documentation at the design level, it is necessary to generate documentati...
Arie van Deursen, Tobias Kuipers