Sciweavers

11808 search results - page 149 / 2362
» Isometries and Computability Structures
Sort
View
IPPS
1999
IEEE
15 years 8 months ago
Dynamic Process Composition and Communication Patterns in Irregularly Structured Applications
In this paper we describe one experiment in which a new coordination language, called MANIFOLD, is used to restructure an existing sequential Fortran code from computational uid dy...
C. T. H. Everaars, Barry Koren, Farhad Arbab
109
Voted
SARA
2000
Springer
15 years 8 months ago
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...
Eyal Amir, Sheila A. McIlraith
GRAPHICSINTERFACE
2009
15 years 2 months ago
Structural differences between two graphs through hierarchies
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
Daniel Archambault
99
Voted
CIE
2005
Springer
15 years 10 months ago
Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures
Two properties of the Co-Spectrum of the Joint Spectrum tely many abstract structures are presented - a Minimal Pair type theorem and the existence of a Quasi-Minimal degree with r...
Alexandra A. Soskova
ICALP
2003
Springer
15 years 9 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen