24,189 research outputs found
A Constraint Programming Approach to Automatic Layout Definition for Search Results
In this paper we describe a general framework based on constraint programming techniques to address the automatic layout definition problem for Web search result pages, considering heterogeneous result items types (e.g., web links, images, videos, maps, etc.). Starting from the entity type(s) specified in the search query and the result types deemed more relevant for the given entity type, we define an optimization problem and a set of constraints that grant the optimal positioning of results in the page, modeled as a grid with assigned weights depending on the visibility
A Constraint Programming Approach to Automatic Layout Definition for Search Results
In this paper we describe a general framework based on constraint programming techniques to address the automatic layout definition problem for Web search result pages, considering heterogeneous result items types (e.g., web links, images, videos, maps, etc.). Starting from the entity type(s) specified in the search query and the result types deemed more relevant for the given entity type, we define an optimization problem and a set of constraints that grant the optimal positioning of results in the page, modeled as a grid with assigned weights depending on the visibility
Recommended from our members
Automatic synthesis of analog layout : a survey
A review of recent research in the automatic synthesis of physical geometry for analog integrated circuits is presented. On introduction, an explanation of the difficulties involved in analog layout as opposed to digital layout is covered. Review of the literature then follows. Emphasis is placed on the exposition of general methods for addressing problems specific to analog layout, with the details of specific systems only being given when they surve to illustrate these methods well. The conclusion discusses problems remaining and offers a prediction as to how technology will evolve to solve them. It is argued that although progress has been and will continue to be made in the automation of analog IC layout, due to fundamental differences in the nature of analog IC design as opposed to digital design, it should not be expected that the level of automation of the former will reach that of the latter any time soon
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs
Drawings of highly connected (dense) graphs can be very difficult to read.
Power Graph Analysis offers an alternate way to draw a graph in which sets of
nodes with common neighbours are shown grouped into modules. An edge connected
to the module then implies a connection to each member of the module. Thus, the
entire graph may be represented with much less clutter and without loss of
detail. A recent experimental study has shown that such lossless compression of
dense graphs makes it easier to follow paths. However, computing optimal power
graphs is difficult. In this paper, we show that computing the optimal
power-graph with only one module is NP-hard and therefore likely NP-hard in the
general case. We give an ILP model for power graph computation and discuss why
ILP and CP techniques are poorly suited to the problem. Instead, we are able to
find optimal solutions much more quickly using a custom search method. We also
show how to restrict this type of search to allow only limited back-tracking to
provide a heuristic that has better speed and better results than previously
known heuristics.Comment: Extended technical report accompanying the PacificVis 2013 paper of
the same nam
Constraint-based graphical layout of multimodal presentations
When developing advanced multimodal interfaces, combining the characteristics of different modalities such as natural language, graphics, animation, virtual realities, etc., the question of automatically designing the graphical layout of such presentations in an appropriate format becomes increasingly important. So, to communicate information to the user in an expressive and effective way, a knowledge-based layout component has to be integrated into the architecture of an intelligent presentation system. In order to achieve a coherent output, it must be able to reflect certain semantic and pragmatic relations specified by a presentation planner to arrange the visual appearance of a mixture of textual and graphic fragments delivered by mode-specific generators. In this paper we will illustrate by the example of LayLab, the layout manager of the multimodal presentation system WIP, how the complex positioning problem for multimodal information can be treated as a constraint satisfaction problem. The design of an aesthetically pleasing layout is characterized as a combination of a general search problem in a finite discrete search space and an optimization problem. Therefore, we have integrated two dedicated constraint solvers, an incremental hierarchy solver and a finite domain solver, in a layered constraint solver model CLAY, which is triggered from a common metalevel by rules and defaults. The underlying constraint language is able to encode graphical design knowledge expressed by semantic/pragmatic, geometrical/topological, and temporal relations. Furthermore, this mechanism allows one to prioritize the constraints as well as to handle constraint solving over finite domains. As graphical constraints frequently have only local effects, they are incrementally generated by the system on the fly. Ultimately, we will illustrate the functionality of LayLab by some snapshots of an example run
- …