Sciweavers

1029 search results - page 36 / 206
» Compact representations of ordered sets
Sort
View
133
Voted
ACL
1996
15 years 3 months ago
Generating an LTAG out of a Principle-based Hierarchical Representation
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
Marie-Hélène Candito
JCST
2008
119views more  JCST 2008»
15 years 2 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
CP
2009
Springer
16 years 3 months ago
Evaluation of Length-Lex Set Variables
This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier wo...
Justin Yip, Pascal Van Hentenryck
101
Voted
TOG
2008
180views more  TOG 2008»
15 years 2 months ago
Diffusion curves: a vector representation for smooth-shaded images
We describe a new vector-based primitive for creating smoothshaded images, called the diffusion curve. A diffusion curve partitions the space through which it is drawn, defining d...
Alexandrina Orzan, Adrien Bousseau, Holger Winnem&...
125
Voted
BMCBI
2006
112views more  BMCBI 2006»
15 years 2 months ago
Protein disorder prediction by condensed PSSM considering propensity for order or disorder
Background: More and more disordered regions have been discovered in protein sequences, and many of them are found to be functionally significant. Previous studies reveal that dis...
Chung-Tsai Su, Chien-Yu Chen, Yu-Yen Ou