Sciweavers

258 search results - page 27 / 52
» Relational Correspondences for Lattices with Operators
Sort
View
BIRTHDAY
2009
Springer
14 years 2 months ago
Formal Series of General Algebras over a Field and Their Syntactic Algebras
Any mapping S : C → K, where K is a field and C = (C, Σ) is a Σ-algebra, is called a KC-series. These series are natural generalizations of both formal series on strings over...
Zoltán Fülöp, Magnus Steinby
AGTIVE
2003
Springer
14 years 24 days ago
Local Specification of Surface Subdivision Algorithms
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
Colin Smith, Przemyslaw Prusinkiewicz, Faramarz F....
EDBT
2009
ACM
137views Database» more  EDBT 2009»
13 years 5 months ago
Flexible and scalable storage management for data-intensive stream processing
Data Stream Management Systems (DSMS) operate under strict performance requirements. Key to meeting such requirements is to efficiently handle time-critical tasks such as managing...
Irina Botan, Gustavo Alonso, Peter M. Fischer, Don...
SIAMNUM
2010
106views more  SIAMNUM 2010»
13 years 2 months ago
Approximation of the Buckling Problem for Reissner-Mindlin Plates
This paper deals with the approximation of the buckling coefficients and modes of a clamped plate modeled by the Reissner-Mindlin equations. These coefficients are related with the...
Carlo Lovadina, David Mora, Rodolfo Rodrígu...
EDOC
2009
IEEE
14 years 2 months ago
Using Enterprise Architecture Management Patterns to Complement TOGAF
—The design of an Enterprise Architecture (EA) management function for an enterprise is no easy task. Various frameworks exist as well as EA management tools, which promise to de...
Sabine Buckl, Alexander M. Ernst, Florian Matthes,...