Sciweavers

1071 search results - page 66 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
CGF
2011
12 years 11 months ago
Procedural Modeling of Interconnected Structures
The complexity and detail of geometric scenes that are used in today’s computer animated films and interactive games have reached a level where the manual creation by tradition...
Lars Krecklau, Leif Kobbelt
ER
2007
Springer
130views Database» more  ER 2007»
14 years 2 months ago
Towards Automated Reasoning on ORM Schemes
The goal of this article is to formalize Object Role Modeling (ORM) using the DLR description logic. This would enable automated reasoning on the formal properties of ORM diagrams,...
Mustafa Jarrar
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 8 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
ESWA
2007
127views more  ESWA 2007»
13 years 8 months ago
Clustering support vector machines for protein local structure prediction
Understanding the sequence-to-structure relationship is a central task in bioinformatics research. Adequate knowledge about this relationship can potentially improve accuracy for ...
Wei Zhong, Jieyue He, Robert W. Harrison, Phang C....
JACM
2010
120views more  JACM 2010»
13 years 2 months ago
The structure of inverses in schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Alan Nash