Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleAugust 1996
(R) FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on Parallel Processors
Abstract: The DAG scheduling problem is a rich land of research and a plethora of algorithms for solving this problem have been reported in the literature. However, designing a scheduling algorithm of low complexity without sacrificing performance ...
- ArticleJune 1996
Blind identification of nonlinear channels excited by discrete alphabet inputs
Hidden Markov models (HMMs) are employed to describe digital communication channels, and their parameters are estimated in a blind fashion. General nonlinear channels can be accommodated which are not restricted to be of the Volterra type. Contrary to ...
- ArticleMay 1996
DNA models and algorithms for NP-complete problems
A goal of research on DNA computing is to solve problems that are beyond the capabilities of the fastest silicon-based supercomputers. Adleman and Lipton present exhaustive search algorithms for 3Sat and 3-Coloring, which can only be run on small ...
- ArticleMay 1996
The program understanding problem: analysis and a heuristic approach
Program understanding is the process of making sense of a complex source code. This process has been considered as computationally difficult and conceptually complex. So far no formal complexity results have been presented, and conceptual models differ ...
- ArticleFebruary 1996
HierarchyScan: A Hierarchical Similarity Search Algorithm for Databases of Long Sequences
We present a hierarchical algorithm, HierarchyScan, that efficiently locates one-dimensional subsequences within a collection of sequences of arbitrary length. The subsequences identified by HierarchyScan match a given template pattern in a scale- and ...
- ArticleFebruary 1996
Design and optimization of complex real-time dependable systems
Proposes the RINDO (Rapid Iterative Nested Design Optimization) algorithm for optimizing multi-criteria complex systems. We first use a utility function to formulate multi-criteria stochastic optimization problems. An ordinal optimization algorithm is ...
- ArticleJanuary 1996
Pattern-Matching in Search Problem Solving
Search problems generally fall into the class of NP-hard problems. Many real problems including planning, diagnosing, allocation tasks, classification tasks and scenario-making, require examination of large search spaces. These problems cannot be solved ...
- ArticleJanuary 1996
Routing using implicit connection graphs [VLSI design
We introduce a framework for a class of algorithms solving shortest path related problems, such as the one-to-one shortest path problem, the one-to-many shortest paths problem and the minimum spanning tree problem, in the presence of obstacles. For ...
- ArticleJanuary 1996
Geometric bipartitioning problem and its applications to VLSI
We identify a new problem called geometric bipartitioning that is useful in VLSI layout design. Given a floorplan with rectilinear modules, the problem is to partition the floor by a staircase (monotone increasing) channel from one corner of the floor ...
- ArticleNovember 1995
Using partial shape knowledge for stereo reconstruction
We describe a scheme for reliable and accurate surface reconstruction when the stereoscopic images contain only fine texture and no stable high level features. The approach uses partial shape information to improve the reliability of the surface ...
- ArticleNovember 1995
Figure-ground segmentation using Tabu search
Many computer vision problems, such as figure-ground segmentation, simultaneous fitting of curves, selection of an optimal set of geometric primitives, can be formulated naturally as discrete optimization problems. The statement of these problems is ...
- ArticleNovember 1995
Where to look next in 3D object search
The task of sensor planning for object search is formulated and a mechanism for "where to look next" for this task is presented. The searcher is assumed to be a mobile platform equipped with an active camera and a method of calculating depth, like ...
- ArticleNovember 1995
Demonstrating polynomial run-time growth for local search matching
Local search is a well established and highly effective general method for solving complex combinatorial optimization problems. We've developed local search techniques to solve difficult geometric matching problems. Matching is posed as the problem of ...
- ArticleNovember 1995
Recognition by matching dense, oriented edge pixels
This paper describes techniques to perform efficient and accurate recognition in difficult domains by matching dense, oriented edge pixels. We model three-dimensional objects as the set of two-dimensional views of the object. Translation, rotation, and ...
- ArticleOctober 1995
A vector quantizer with increased codebook patterns
In this paper, we present an approach to increase the amount of VQ codebook patterns to improve image quality without a large overhead on the memory and search time. Basically, our approach characterizes a pattern into a key value, which is used in ...
- ArticleOctober 1995
Automated processor specification and task allocation for embedded multicomputer systems: The packing-based approaches
This paper considers the coupled design problems of processor specification and task allocation for embedded multicomputer systems. A packing-based representation is proposed that allows the problems to be solved concurrently. An algorithm based on this ...
- ArticleOctober 1995
H-PBS: a hash-based scalable technique for parallel bidirectional search
We introduce a very simple and efficient hash-based algorithm for parallel bidirectional search. Hashing is used in a novel way to continuously provide every processor with a good cross section of the search front. This hashing serves multiple purposes ...
- ArticleOctober 1995
A generalized utility for parallel branch and bound algorithms
Branch and bound algorithms are general methods applied to various combinatorial optimization problems. Recently, parallelizations of these algorithms have been proposed. In spite of the generality of these methods, many of the parallelizations have ...
- ArticleOctober 1995
A pyramid algorithm for fast fractal image compression
We present a fast fractal image encoding algorithm which is based on a refinement of the fractal code from an initial coarse level of the pyramid. The pyramid search algorithm is quasi-optimal in terms of minimizing the mean square error. Assuming that ...