Results 1  10
of
14,561
A Logical Design Methodology for Relational Databases Using the Extended EntityRelationship Model
 ACM Computing Surveys
, 1986
"... A database design methodology is defined for the design of large relational databases. First, the data requirements are conceptualized using an extended entityrelationship model, with the extensions being additional semantics such as ternary relationships, optional relationships, and the generaliza ..."
Abstract

Cited by 177 (2 self)
 Add to MetaCart
, and the generalization abstraction. The extended entityrelationship model is then decomposed according to a set of basic entityrelationship constructs, and these are transformed into candidate relations. A set of basic transformations has been developed for the three types of relations: entity relations, extended
An algorithm for drawing general undirected graphs
 Information Processing Letters
, 1989
"... Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets, and entit ..."
Abstract

Cited by 698 (2 self)
 Add to MetaCart
, and entityrelationship diagrams, basic graph drawing algorithms are required.
A Bayesian method for the induction of probabilistic networks from data
 MACHINE LEARNING
, 1992
"... This paper presents a Bayesian method for constructing probabilistic networks from databases. In particular, we focus on constructing Bayesian belief networks. Potential applications include computerassisted hypothesis testing, automated scientific discovery, and automated construction of probabili ..."
Abstract

Cited by 1400 (31 self)
 Add to MetaCart
of probabilistic expert systems. We extend the basic method to handle missing data and hidden (latent) variables. We show how to perform probabilistic inference by averaging over the inferences of multiple belief networks. Results are presented of a preliminary evaluation of an algorithm for constructing a belief
Greedy Randomized Adaptive Search Procedures
, 2002
"... GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract

Cited by 647 (82 self)
 Add to MetaCart
GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search
Linear pattern matching algorithms
 IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE
, 1972
"... In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear ti ..."
Abstract

Cited by 546 (0 self)
 Add to MetaCart
time algorithm for obtaining a compacted version of a bitree associated with a given string is presented. With this construction as the basic tool, we indicate how to solve several pattern matching problems, including some from [4], in linear time.
Parallel Numerical Linear Algebra
, 1993
"... We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illust ..."
Abstract

Cited by 773 (23 self)
 Add to MetaCart
We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We
The English Noun Phrase in its Sentential Aspect
 PH.D. DISSERTATION MIT
, 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by a functional element (i.e., "nonlexical" category) D, identified with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by Infl(ection), under ass ..."
Abstract

Cited by 532 (4 self)
 Add to MetaCart
assumptions now standard within the GovernmentBinding (GB) framework. The central empirical problem addressed is the question of the proper analysis of the socalled "Possing" gerund in English. This construction possesses simultaneously many properties of sentences, and many properties of noun
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
Globus: A Metacomputing Infrastructure Toolkit
 International Journal of Supercomputer Applications
, 1996
"... Emerging highperformance applications require the ability to exploit diverse, geographically distributed resources. These applications use highspeed networks to integrate supercomputers, large databases, archival storage devices, advanced visualization devices, and/or scientific instruments to for ..."
Abstract

Cited by 1929 (51 self)
 Add to MetaCart
. In this article, we introduce Globus, a system that we are developing to address these challenges. The Globus system is intended to achieve a vertically integrated treatment of application, middleware, and network. A lowlevel toolkit provides basic mechanisms such as communication, authentication, network
Software pipelining: An effective scheduling technique for VLIW machines
, 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract

Cited by 581 (3 self)
 Add to MetaCart
hierarchical reduction scheme whereby entire control constructs are reduced to an object similar to an operation in a basic block. With this scheme, all innermost loops, including those containing conditional statements, can be software pipelined. It also diminishes the startup cost of loops with small
Results 1  10
of
14,561