Search
Now showing items 191-200 of 219
Comparison of techniques used for mapping parallel algorithms to message-passing multiprocessors
(IEEE, 1994)
This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of ...
On kernels, defaults and even graphs
(1997)
Extensions in prerequisite-free, disjunction-free default theories have been shown to be in direct correspondence with kernels of directed graphs
Graph theoretical structures in logic programs and default theories
(1996)
In this paper we present a graph representation of logic programs and default theories. We show that many of the semantics proposed for logic programs with negation can be expressed in terms of notions emerging from graph ...
Linearizability in the presence of drifting clocks and under different delay assumptions
(1999)
The cost of usingmessag e-passing to implement linearizable read/write objects for shared memory multiprocessors with drifting clocks is studied. We take as cost measures the response times for performingread and write ...
Qualitative morphological analysis of muscle biopsies using neural networks
(Publ by IEEE, 1993)
Qualitative data from human muscle biopsies have been extracted and analyzed by artificial neural network (ANN) models trained with the Kohonen's self-organizing feature maps algorithm to provide an automated medical ...
Viewspace partitioning of densely occluded scenes
(ACM, 1998)
Computing the visibility of out-door scenes is often much harder than of in-door scenes. The difficulty is that although the majority of objects are hidden, some parts might be visible at a distance in an arbitrary location, ...
Shadow computation for 3D interaction and animation.
(University of London, 1996)
Optimal, distributed decision-making: The case of no communication
(1999)
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in the presence of incomplete information
Shadow volume BSP trees for computation of shadows in dynamic scenes
(ACM, 1995)
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modification of Shadow Volume Binary Space Partition trees, to allow these be ...
Computing Dynamic Changes to BSP Trees
(1992)
This paper investigates a new method for dynamically changing Binary Space Partition (BSP) trees. A BSP tree representation of a 3D polygonal scene provides an ideal data structure for rapidly performing the hidden surface ...