Sciweavers

1055 search results - page 4 / 211
» Enumerations in computable structure theory
Sort
View
ISMB
2000
13 years 9 months ago
Search for a New Description of Protein Topology and Local Structure
A novel description of protein structure in terms of the generalized secondary structure elements (GSSE) is proposed. GSSE's are defined as fragments of the protein structure...
Lukasz Jaroszewski, Adam Godzik
HICSS
2003
IEEE
130views Biometrics» more  HICSS 2003»
14 years 1 months ago
Politeness Theory and Computer-Mediated Communication: A Sociolinguistic Approach to Analyzing Relational Messages
This conceptual paper suggests how Politeness Theory [6] – well known in anthropological and linguistic literatures – can contribute to the study of role relations in computer...
David A. Morand, Rosalie J. Ocker
KCAP
2011
ACM
12 years 10 months ago
Eliciting hierarchical structures from enumerative structures for ontology learning
Some discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hi...
Mouna Kamel, Bernard Rothenburger
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 1 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
DM
2011
158views Education» more  DM 2011»
12 years 11 months ago
A survey of homogeneous structures
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...
Dugald Macpherson