Sciweavers

116 search results - page 5 / 24
» Composition and Decomposition in True-Concurrency
Sort
View
RT
1999
Springer
13 years 11 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool
HPCC
2005
Springer
14 years 1 months ago
Distributed Query Optimization in the Stack-Based Approach
Abstract. We consider query execution strategies for object-oriented distributed databases. There are several scenarios of query decomposition, assuming that the corresponding quer...
Hanna Kozankiewicz, Krzysztof Stencel, Kazimierz S...
ISMVL
1997
IEEE
82views Hardware» more  ISMVL 1997»
13 years 11 months ago
Finding Composition Trees for Multiple-Valued Functions
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
Elena Dubrova, Jon C. Muzio, Bernhard von Stengel
ATVA
2006
Springer
153views Hardware» more  ATVA 2006»
13 years 11 months ago
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
Wonhong Nam, Rajeev Alur
JLP
2008
108views more  JLP 2008»
13 years 7 months ago
Composition mechanisms for retrenchment
Abstract. Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imposed by refinement, and for which the proof obligations feature additi...
Richard Banach, Czeslaw Jeske, Michael Poppleton