Now showing items 1-5 of 5
Analysis of the n-dimensional quadtree decomposition for arbitrary hyper-rectangles
We give a closed-form expression for the average number of n- dimensional quadtree nodes (ieces' or locks') required by an n-dimensional hyper-rectangle aligned with the axes. Our formula includes as special cases the ...
Manufacturing Feature Instances: Which Ones to Recognize?
Manufacturing features and feature-based representations have become an integral part of research on manufacturing systems, largely due to their ability to model correspondences between design information and manufacturing ...
Fast Map: A Fast Algorithms for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]. Thus, we can subsequently ...
On Parallel-Machine Scheduling with Operator-Constrained Setups
The processing of a task on a machine often requires an operator to setup the job. In this paper we consider the problem of scheduling a finite set of jobs on a number of identical parallel machines. Each job has a setup ...
Similarity Searching in Large Image DataBases
We propose a method to handle approximate searching by image content in large image databases. Image content is represented by attributed relational graphs holding features of objects and relationships between objects. The ...