Sciweavers

3172 search results - page 459 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
ESSLLI
1999
Springer
15 years 10 months ago
Weak Equivalence in Propositional Calculus
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
Stefan Andrei
ICDE
1998
IEEE
99views Database» more  ICDE 1998»
15 years 10 months ago
Query Folding with Inclusion Dependencies
Query folding is a technique for determining how a query may be answered using a given set of resources, which may include materialized views, cached results of previous queries, ...
Jarek Gryz
ADAEUROPE
1998
Springer
15 years 10 months ago
Automating the Ada Binding Process for Java- How Far Can We Go?
This paper describes an automated approach for generating Ada bindings from Java class files. We start with the set of Java features that require a visible Ada binding, and an Ada ...
David E. Emery, Robert F. Mathias, Karl A. Nyberg
CHI
1998
ACM
15 years 10 months ago
What can I say? Evaluating a Spoken Language Interface to Email
This paper presents experimental results comparing two different designs for a spoken language interface to email. We compare a mixed-initiative dialogue style, in which users can...
Marilyn A. Walker, Jeanne Fromer, Giuseppe Di Fabb...
APSEC
1997
IEEE
15 years 10 months ago
Using Extended Event Traces to Describe Communication in Software Architectures
A crucial aspect of the architecture of a software system is its decomposition into components and the specification of component interactions. In this report we use a variant of...
Manfred Broy, Christoph Hofmann, Ingolf Krüge...