Sciweavers

2834 search results - page 290 / 567
» Representing Trees with Constraints
Sort
View
WIA
2009
Springer
15 years 11 months ago
On Extremal Cases of Hopcroft's Algorithm
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
Giusi Castiglione, Antonio Restivo, Marinella Scio...
SSD
2001
Springer
113views Database» more  SSD 2001»
15 years 11 months ago
Object-Relational Indexing for General Interval Relationships
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
ICPP
1998
IEEE
15 years 11 months ago
The Postal Network: A Versatile Interconnection Topology
The postal network is an interconnection network that possesses many desirable properties which are important in network design and applications. It includes hypercubes and Fibona...
Jie Wu, Yuanyuan Yang
IPPS
1996
IEEE
15 years 10 months ago
Kiloprocessor Extensions to SCI
To expand the Scalable Coherent Interface's (SCI) capabilities so it can be used to efficiently handle sharing in systems of hundreds or even thousands of processors, the SCI...
Stefanos Kaxiras
136
Voted
AIMSA
1990
Springer
15 years 10 months ago
Compilation of Recursive Two-Literal Clauses into Unification Algorithms
: Automated deduction systems can considerably be improved by replacing axioms with special purpose inference mechanisms. For example replacing in resolution based systems certain ...
Hans Jürgen Ohlbach