29522196
On uniquely intersectable graphs
Abstract The concept of unique intersectability of a graph is introduced; this is related to the intersection number of a graph. The triangle-free condition is sufficient but not necessary for a graph to be uniquely intersectable. Other results related to the intersection number of a graph and its unique intersectability are established. Four families of graphs with triangles are shown to be uniquely intersectable.
41375498
On line graphs which are weakly maximal clique irreducible
195837988
An optimal algorithm for floorplan area optimization
An optimal algorithm for the VLSI floorplan area optimization problem is presented. The algorithm is an extension of the technique described by L. Stockmeyer (Information and Control, vol.59, p.91-101, 1983). Experimental results indicate that this algorithm pruned a very large number of redundant implementations. In addition, since the algorithm basically exploits the geometric property of the topology of the given floorplan it does not need to depend on the polar dual graphs to calculate the longest paths. Consequently it is able to run more efficiently than the branch-and-bound algorithm.<<ETX>>
206985371
Framework and network based multimedia object management environment
Because multimedia objects are becoming more prevalent, on ever increasing volume, inventing an efficient multimedia object management environment is a matter of increasing urgency. In recognition of this crisis, we developed the multimedia object management environment (MOME) that includes a suite of tools such as the Vortex framework, and network file indexer (NFI). MOME also includes a fully featured graphical user interface for maximum user control and flexibility. With meta data, it automatically generates indexes and paths for different types of multimedia objects and allows users to quickly find what they are looking for. In this paper, we address the background, architecture, and performance of MOME in detail.
18451647
Optimal circuit clustering for delay minimization under a more general delay model
This paper considers the area-constrained clustering of combinational circuits for delay minimization under a more general delay model, which practically takes variable interconnect delay into account. Our delay model is particularly applicable when allowing the back-annotation of actual delay information to drive the clustering process. We present a vertex grouping technique and integrate it with the algorithm (Rajaraman and Wong, 1995) such that our algorithm can be proved to solve the problem optimally in polynomial time.
28214269
Active rule processing in the BioCompose database
BioCompose is an object-relational database query tool that runs on top of any relational database and provides an intelligent and complete object-relational interface to the user. Unlike the traditional approach, which is completely table driven, queries in BioCompose are structured along the lines of natural language and sentences. In BioCompose, the database server continuously monitors the triggers and integrity constraints which are expressed as logical rules and are evaluated based on incoming events which include real time events, value events, transaction events, abstract events, and message events. The paper presents a novel approach that compiles triggers and integrity constraints into an asynchronous network to minimize the rule evaluation effort under different kinds of events.
33719933
Possibilistic C-Template Clustering and Its Application in Object Detection in Images
We present in this paper a new type of alternating-optimization based possibilistic c-shell clustering algorithm called possibilistic c-template (PCT). A template is represented by a set of line segments. A cluster prototype consists of a copy of the template after translation, scaling, and rotation transforms. This extends the capability of shell clustering beyond a few standard geometrical shapes that have been studied so far. We use a number of 2-dimensional data sets to illustrate the application of our algorithm in detecting generic template-based shapes in images. Techniques taken to relax the requirements of known number of clusters and good initialization are also described. Results for both synthetic and actual image data are presented.