Sciweavers

1034 search results - page 107 / 207
» Wide Classes
Sort
View
CADE
1998
Springer
14 years 1 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
ER
1998
Springer
106views Database» more  ER 1998»
14 years 1 months ago
Chrono: A Conceptual Design Framework for Temporal Entities
Abstract. Database applications are frequently faced with the necessity of representing time varying information and, particularly in the management of information systems, a few k...
Sonia Bergamaschi, Claudio Sartori
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
14 years 1 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina
IPPS
1997
IEEE
14 years 1 months ago
Semantics and Implementation of a Generalized forall Statement for Parallel Languages
In this paper we present a generalized forall statement for parallel languages. The forall statement occurs in many (data) parallel languages and specifies which computations can...
Paul Dechering, Leo C. Breebaart, Frits Kuijlman, ...
ITC
1993
IEEE
148views Hardware» more  ITC 1993»
14 years 29 days ago
DELTEST: Deterministic Test Generation for Gate-Delay Faults
This paper presents an efficient approach to generate tests for gate delay faults. Unlike other known algorithms which try to generate a 'good' delay test the presented ...
Udo Mahlstedt