Sciweavers

595 search results - page 119 / 119
» The Graph Programming Language GP
Sort
View
FOCS
1998
IEEE
13 years 11 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ZUM
1997
Springer
125views Formal Methods» more  ZUM 1997»
13 years 11 months ago
A Formal OO Method Inspired by Fusion and Object-Z
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
Klaus Achatz, Wolfram Schulte
SIGGRAPH
1991
ACM
13 years 10 months ago
Visibility preprocessing for interactive walkthroughs
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g....
Seth J. Teller, Carlo H. Séquin
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
12 years 9 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
TFM
2009
Springer
252views Formal Methods» more  TFM 2009»
14 years 1 months ago
Abstraction and Modelling: A Complementary Partnership
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
Jeffrey Kramer