## Search

Now showing items 1-10 of 34

#### LinGraph: a graph-based automated planner for concurrent task planning based on linear logic

(Springer New York LLC, 2017)

In this paper, we introduce an automated planner for deterministic, concurrent domains, formulated as a graph-based theorem prover for a propositional fragment of intuitionistic linear logic, relying on the previously ...

#### Sweeping with all graphical ingredients in a topological picturebook

(Elsevier, 1992)

Sweeping is a powerful method to generate 3-D shapes in geometric modeling. In this paper we formulate a general matrix to give a mathematical definition of twisted-profiled sweep objects as a discrete approximation. While ...

#### A compound graph layout algorithm for biological pathways

(Springer, Berlin, Heidelberg, 2004-09-10)

We present a new compound graph layout algorithm based on traditional force-directed layout scheme with extensions for nesting and other application-specific constraints. The algorithm has been successfully implemented ...

#### Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication

(IEEE, 1999)

In this work, we show that the standard graph-partitioning-based decomposition of sparse matrices does not reflect the actual communication volume requirement for parallel matrix-vector multiplication. We propose two ...

#### Solving tangram puzzles: a connectionist approach

(John Wiley & Sons, 1993)

We present a connectionist approach for solving Tangram puzzles. Tangram is an ancient Chinese puzzle where the object is to decompose a given figure into seven basic geometric figures. One connectionist approach models ...

#### S3-TM: scalable streaming short text matching

(Association for Computing Machinery, 2015)

Micro-blogging services have become major venues for information creation, as well as channels of information dissemination. Accordingly, monitoring them for relevant information is a critical capability. This is typically ...

#### Improving performance of sparse matrix dense matrix multiplication on large-scale parallel systems

(Elsevier BV, 2016)

We propose a comprehensive and generic framework to minimize multiple and different volume-based communication cost metrics for sparse matrix dense matrix multiplication (SpMM). SpMM is an important kernel that finds ...

#### Incremental k-core decomposition: algorithms and evaluation

(Association for Computing Machinery, 2016)

A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, ...

#### Exploiting locality in sparse matrix-matrix multiplication on many-core rchitectures

(IEEE Computer Society, 2017)

Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form C=A,B on many-core architectures. Hypergraph ...

#### Fast optimal load balancing algorithms for 1D partitioning

(Academic Press, 2004)

The one-dimensional decomposition of nonuniform workload arrays with optimal load balancing is investigated. The problem has been studied in the literature as the "chains-on-chains partitioning" problem. Despite the rich ...