Sciweavers

1087 search results - page 67 / 218
» Eta-Redexes in Partial Evaluation
Sort
View
XIMEP
2004
ACM
74views Database» more  XIMEP 2004»
15 years 11 months ago
Schema Validation and Type Annotation for Encoded Trees
We argue that efficient support for schema validation and type annotation in XQuery processors deserves as much attention as efficient evaluation techniques for XPath queries have...
Torsten Grust, Stefan Klinger
SIAMSC
2010
159views more  SIAMSC 2010»
15 years 4 months ago
Parameter and State Model Reduction for Large-Scale Statistical Inverse Problems
A greedy algorithm for the construction of a reduced model with reduction in both parameter and state is developed for efficient solution of statistical inverse problems governed b...
Chad Lieberman, Karen Willcox, Omar Ghattas
CSFW
1997
IEEE
15 years 10 months ago
Eliminating Covert Flows with Minimum Typings
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
Dennis M. Volpano, Geoffrey Smith
CAV
2007
Springer
108views Hardware» more  CAV 2007»
15 years 10 months ago
Parametric and Sliced Causality
Abstract. Happen-before causal partial orders have been widely used in concurrent program verification and testing. This paper presents a parametric approach to happen-before causa...
Feng Chen, Grigore Rosu
IS
2006
15 years 6 months ago
Negations and document length in logical retrieval
Abstract. Terms which are not explicitly mentioned in the text of a document receive often a minor role in current retrieval systems. In this work we connect the management of such...
David E. Losada, Alvaro Barreiro