Results 1  10
of
649,497
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
libraries: a graphbased algorithm
, 2006
"... A phagedisplay library of random peptides is a combinatorial experimental technique that can be harnessed for studying antibody–antigen interactions. In this technique, a phage peptide library is scanned against an antibody molecule to obtain a set of peptides that are bound by the antibody with hi ..."
Abstract
 Add to MetaCart
with high affinity. This set of peptides is regarded as mimicking the genuine epitope of the antibody’s interacting antigen and can be used to define it. Here we present PepSurf, an algorithm for mapping a set of affinityselected peptides onto the solved structure of the antigen. The problem of epitope
The Effectiveness of a Graphbased Algorithm for Stemming
 Digital Libraries: People, Knowledge, and Technology. Proceedings of 5th International Conference on Asian Digital Libraries (ICADL 2002
"... Abstract. In Information Retrieval (IR), stemming enables a matching of query and document terms which are related to a same meaning but which can appear in different morphological variants. In this paper we will propose and evaluate a statistical graphbased algorithm for stemming. Considering th ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. In Information Retrieval (IR), stemming enables a matching of query and document terms which are related to a same meaning but which can appear in different morphological variants. In this paper we will propose and evaluate a statistical graphbased algorithm for stemming. Considering
EXTENSIONS OF CERTAIN GRAPHBASED ALGORITHMS FOR PRECONDITIONING
, 2007
"... The original TPABLO algorithms are a collection of algorithms which compute a symmetric permutation of a linear system such that the permuted system has a relatively full block diagonal with relatively large nonzero entries. This block diagonal can then be used as a preconditioner. We propose and an ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The original TPABLO algorithms are a collection of algorithms which compute a symmetric permutation of a linear system such that the permuted system has a relatively full block diagonal with relatively large nonzero entries. This block diagonal can then be used as a preconditioner. We propose
A GraphBased Algorithm for Automated Refactoring
"... Software reuse is advocated for increasing the productivity of software engineers and improving the quality of software. As softwarereuse practices are institutionalized, there must be formal techniques and associated methodologies for software engineers to accurately assess and increase the potent ..."
Abstract
 Add to MetaCart
refactoring algorithm based on graph theory. The algorithm has for objective the automation of the reusability assessment process by selecting and applying refactorings that improve reuse utilizing a topological sort of the dependency graph of the software. The result of this new algorithm is detailed
Loci: A Deductive Framework for GraphBased Algorithms
 THIRD INTERNATIONAL SYMPOSIUM ON COMPUTING IN OBJECTORIENTED PARALLEL ENVIRONMENTS, NUMBER 1732 IN LECTURE NOTES IN COMPUTER SCIENCE
, 1999
"... Modern computational fluid dynamics (CFD) software is complex. Often CFD simulations require complex geometries, flexible boundary conditions, multiple integrated computational models (for example, heat conduction, structural deformations, gas dynamics, etc.), as well as grid adaptation. As a re ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Modern computational fluid dynamics (CFD) software is complex. Often CFD simulations require complex geometries, flexible boundary conditions, multiple integrated computational models (for example, heat conduction, structural deformations, gas dynamics, etc.), as well as grid adaptation. As a result of this complexity, the correct implementation of numerical simulation components is actually less challenging than guaranteeing the correct coordination of complex component interactions. If one is to consider the development of CFD applications that reliably incorporate a broad selection of numerical models, then one must consider technologies that simplify, automate, and validate the numerical model coordination mechanisms. The Loci system presented here addresses these issues by introducing a deductive framework for the coordination of numerical value classes constructed in C++.
New GraphBased Algorithms for Partitioning VLSI Circuits
"... When designing a circuit, it may be too large to fit on a single layer of a chip, on a single chip, or on a single board. Regardless of the design level, the same objectives remain. Normally, it is desirable to minimize the number of layers, chips, or boards, along with minimizing the delay. Additio ..."
Abstract
 Add to MetaCart
. Additional constraints, such as the number of interconnections and power consumption, must often be considered. We have developed two kway bounded partitioning algorithms; one is evolutionarybased, while the other is a hierarchical graph centerbased approach. The algorithms are implemented and compared
A graphbased algorithm for categorizing Wikipedia articles
"... In 2005 Wikipedia implemented a category system for the purposes of facilitating navigation throughout the site. Since then, it has grown to 1.5 million categories covering over four million articles. Currently, all categorization of articles on Wikipedia is done by human editors—a task which invol ..."
Abstract
 Add to MetaCart
involves an enormous amount of repetitive work. This paper details the results of building an automated system that suggests missing categoryarticle links to editors through a browserbased userinterface. This system utilizes the existing corpus of humancategorized articles, as well as available
A Survey of Graphbased Algorithms in Software Model Checking
, 2000
"... In this paper we survey different graphbased algorithms that can be used to solve the automatatheoretic modelchecking problem. We concentrate on existing depthfirst search algorithms to locate stronglyconnected components, and describe different optimization and approximation techniques that ..."
Abstract
 Add to MetaCart
In this paper we survey different graphbased algorithms that can be used to solve the automatatheoretic modelchecking problem. We concentrate on existing depthfirst search algorithms to locate stronglyconnected components, and describe different optimization and approximation techniques
Efficient graphbased algorithms for discovering and maintaining association rules in large databases
 Knowl. Inf. Syst
, 2001
"... Abstract In this paper, we study the issues of mining and maintaining association rules in a large database of customer transactions. The problem of mining association rules can be mapped into the problems of finding large itemsets which are sets of items bought together in a sufficient number of tr ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
of transactions. We revise a graphbased algorithm to further speed up the process of itemset generation. In addition, we extend our revised algorithm to maintain discovered association rules when incremental or decremental updates are made to the databases. Experimental results show the efficiency of our
Results 1  10
of
649,497