Sciweavers

2233 search results - page 151 / 447
» Modular type classes
Sort
View
APAL
2006
67views more  APAL 2006»
15 years 2 months ago
Pretopologies and a uniform presentation of sup-lattices, quantales and frames
We introduce the notion of infinitary preorder and use it to obtain a predicative presentation of sup-lattices by generators and relations. The method is uniform in that it extend...
Giulia Battilotti, Giovanni Sambin
122
Voted
FAC
2010
105views more  FAC 2010»
15 years 1 months ago
A formalization of geometric constraint systems and their decomposition
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...
Pascal Mathis, Simon E. B. Thierry
122
Voted
JLP
2010
142views more  JLP 2010»
14 years 9 months ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer
105
Voted
SIGARCH
2010
91views more  SIGARCH 2010»
14 years 9 months ago
Programming framework for clusters with heterogeneous accelerators
We describe a programming framework for high performance clusters with various hardware accelerators. In this framework, users can utilize the available heterogeneous resources pr...
Kuen Hung Tsoi, Anson H. T. Tse, Peter Pietzuch, W...
248
Voted
AMW
2011
14 years 6 months ago
Subqueries in SPARQL
Subqueries are a poweful feature which allows to enforce reuse, composition, rewriting and optimization in a query language. In this paper we perform a comprehensive study of the i...
Renzo Angles, Claudio Gutierrez