Sciweavers

1071 search results - page 144 / 215
» Programming with enumerable sets of structures
Sort
View
IFIP
2004
Springer
15 years 4 months ago
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
Chung-Chih Li
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 4 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
IFIP
2000
Springer
15 years 2 months ago
Information Systems Conceptual Foundations: Looking Backward and Forward
The academic field of information systems has developed because organizations use a specialized body of knowledge about information and communications systems. Teaching and resear...
Gordon B. Davis
SIGADA
2001
Springer
15 years 3 months ago
Automating software module testing for FAA certification
Automatic software testing is gradually becoming accepted practice in the software industry. The shrinking development cycle and higher expectation of software quality are forcing...
Usha Santhanam
PPDP
2010
Springer
14 years 9 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu