104,257 research outputs found
Orientation-Constrained Rectangular Layouts
We construct partitions of rectangles into smaller rectangles from an input
consisting of a planar dual graph of the layout together with restrictions on
the orientations of edges and junctions of the layout. Such an
orientation-constrained layout, if it exists, may be constructed in polynomial
time, and all orientation-constrained layouts may be listed in polynomial time
per layout.Comment: To appear at Algorithms and Data Structures Symposium, Banff, Canada,
August 2009. 12 pages, 5 figure
Dagstuhl Reports : Volume 1, Issue 2, February 2011
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn
Area-Universal Rectangular Layouts
A rectangular layout is a partition of a rectangle into a finite set of
interior-disjoint rectangles. Rectangular layouts appear in various
applications: as rectangular cartograms in cartography, as floorplans in
building architecture and VLSI design, and as graph drawings. Often areas are
associated with the rectangles of a rectangular layout and it might hence be
desirable if one rectangular layout can represent several area assignments. A
layout is area-universal if any assignment of areas to rectangles can be
realized by a combinatorially equivalent rectangular layout. We identify a
simple necessary and sufficient condition for a rectangular layout to be
area-universal: a rectangular layout is area-universal if and only if it is
one-sided. More generally, given any rectangular layout L and any assignment of
areas to its regions, we show that there can be at most one layout (up to
horizontal and vertical scaling) which is combinatorially equivalent to L and
achieves a given area assignment. We also investigate similar questions for
perimeter assignments. The adjacency requirements for the rectangles of a
rectangular layout can be specified in various ways, most commonly via the dual
graph of the layout. We show how to find an area-universal layout for a given
set of adjacency requirements whenever such a layout exists.Comment: 19 pages, 16 figure
Ensemble Learning for Free with Evolutionary Algorithms ?
Evolutionary Learning proceeds by evolving a population of classifiers, from
which it generally returns (with some notable exceptions) the single
best-of-run classifier as final result. In the meanwhile, Ensemble Learning,
one of the most efficient approaches in supervised Machine Learning for the
last decade, proceeds by building a population of diverse classifiers. Ensemble
Learning with Evolutionary Computation thus receives increasing attention. The
Evolutionary Ensemble Learning (EEL) approach presented in this paper features
two contributions. First, a new fitness function, inspired by co-evolution and
enforcing the classifier diversity, is presented. Further, a new selection
criterion based on the classification margin is proposed. This criterion is
used to extract the classifier ensemble from the final population only
(Off-line) or incrementally along evolution (On-line). Experiments on a set of
benchmark problems show that Off-line outperforms single-hypothesis
evolutionary learning and state-of-art Boosting and generates smaller
classifier ensembles
- …