The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
In this paper, we propose a semantic-meaningful approach for region-based image retrieval in image database. Our retrieval system is based on wavelet transform for its decompositi...
The mining of informative rules calls for methods that include different attributes (e.g., weights, quantities, multipleconcepts) suitable for the context of the problem to be an...
In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery’s interior or walls with a number of guards that must be placed strategically in the...