Cube pruning is a fast inexact method for generating the items of a beam decoder. In this paper, we show that cube pruning is essentially equivalent to A* search on a specific search space with specific heuristics. We use this insight to develop faster and exact variants of cube pruning.

In this paper, we propose several results about trajec-tory generation by visual servoing. The approach consists in deening a speciic task function which allows us to take into account the time varying aspect of the reference feature and we synthesize a control law in the sensor space. This control law ensures the trajectory control in the image space and reduces the tracking error. Under speci...

Recent technological advances have increased the quantity of movement data being recorded. While valuable knowledge can be gained by analysing such data, its sheer volume creates challenges. Geovisual analytics, which helps the human cognition process by using tools to reason about data, offers powerful techniques to resolve these challenges. This paper introduces such a geovisual analytics env...

Datacubes are especially useful for answering efficiently queries on data warehouses. Nevertheless the amount of generated aggregated data is huge with respect to the initial data which is itself very large. Recent research work has addressed the issue of summarizing Datacubes in order to reduce their size. In this chapter, we present three different approaches. They propose structures which ma...

We begin by considering certain analogues, in finite 3-dimensional affine spaces, of the ordinary cube. From the properties of these structures (as geometric lattices having point sets which are threefold Cartesian products) we derive the notion of an (abstract) finite cube. By studying the additional properties (including the properties of certain groups associated with the cube) of members of...

Data warehouse views typically store large aggregate tables based on a subset of dimension attributes of the main data warehouse fact table. Aggregate views can be stored as 2n subviews of a data cube with n attributes. Methods have been proposed for selecting only some of the data cube views to materialize in order to speed up query response time, accommodate storage space constraint and reduc...

Data cube has been playing an essential role in fast OLAP (online analytical processing) in many multi-dimensional data warehouses. However, there exist data sets in applications like bioinformatics, statistics, and text processing that are characterized by high dimensionality, e.g., over 100 dimensions, and moderate size, e.g., around 10 tuples. No feasible data cube can be constructed with su...

Satisfiability solvers targeting industrial instances are currently almost always based on conflict-driven clause learning (CDCL) [5]. This technique can successfully solve very large instances. Yet on small, hard problems lookahead solvers [3] often perform better by applying much more reasoning in each search node and then recursively splitting the search space until a solution is found. The ...

– (p, q) (p > 2, q = 2). These infinite tiling series of cubes are the special cases of the classical Lambert-cube tilings. The dihedral angles of the Lambert-cube are πp (p > 2) at the 3 skew edges and π2 at the other edges. Their metric realization in the hyperbolic space H 3 is well known. A simple proof was described by E. Molnár in [10]. The volume of this Lambert-cube type was determined ...