A data warehouse stores lots of materialized views to provide an efficient decision-support or OLAP queries. The view-selection problem addresses to select a fittest set of materialized views from a variety of MVPPs (Yang, 1997) forms a challenge in data warehouse research. In this paper, we present genetic algorithm to choose materialized views. We also use experiments to demonstrate the power...

Silhouettes of polyhedra are an important primitive in application areas such as machine vision and computer graphics. In this paper, we study how to select view points of convex polyhedra such that the silhouette satisfies certain properties. Specifically, we give algorithms to find all projections of a convex polyhedron such that a given set of edges, faces and/or vertices appear on the silho...

The problem of model selection by cross-validation is addressed in the density estimation framework. Extensively used in practice, cross-validation (CV) remains poorly understood, especially in the non-asymptotic setting which is the main concern of this work. A recurrent problem with CV is the computation time it involves. This drawback is overcome here thanks to closed-form expressions for th...

Dense image matching methods enable efficient 3D data acquisition. Digital cameras are available at high resolution, high geometric and radiometric quality and high image repetition rate. They can be used to acquire imagery for photogrammetric purposes in short time. Photogrammetric image processing methods deliver 3D information. For example, Structure from Motion reconstruction methods can be...

Computer vision often concerns the estimation of models of the world from visual input. Sometimes it is possible to fit several different models or hypotheses to a set of data, the choice of which is usually left to the vision practitioner. This paper explores ways of automating the model selection process, with specific emphasis on the least squares problem. The statistical literature is revie...

Whereas the selection concept of Genetic Algorithms (GAs) and Genetic Programming (GP) is basically realized by the selection of above-average parents for reproduction, Evolution Strategies (ES) use the fitness of newly evolved offspring as the basis for selection (survival of the fittest due to birth surplus). This contribution proposes a generic and enhanced selection model for GAs considerin...

Using materialized views can highly speed up the query processing time. This paper deals with the view selection issue, which consists in finding a set of views to materialize that minimizes the expected cost of evaluating the query workload, given a limited amount of resource such as total view maintenance cost and/or storage space. However, the solution space is huge since it entails a large ...

We propose a novel general framework with a boosting algorithm to achieve active object classification by view selection. The proposed framework actively decides the next best view for the recognition task. It evaluates different information sources for top hypotheses, generates a voting matrix for candidate views and the view selection is achieved by picking up the one with the maximum votes. ...

Selective materialization of intermediate query results as views is an effective method for improving query performance. In this paper, we extend this technique to adaptively partition views based on the access patterns of a workload. That is, we collect information about the selection conditions of queries at runtime and utilize this information to determine fragment boundaries for the initial...

Natural selection explains how living forms are fitted to their conditions of life. Darwin argued that selection also explains what he called “the gradual advancement of the organisation,” i.e. evolutionary progress. Present-day selectionists disagree. In their view, it is happenstance that sustains conditions favorable to progress, and therefore happenstance, not selection, that explains progr...