Sciweavers

985 search results - page 61 / 197
» Piercing Convex Sets
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
A-Functions: A generalization of Extended Baum-Welch transformations to convex optimization
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
Dimitri Kanevsky, David Nahamoo, Tara N. Sainath, ...
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 8 months ago
A graph-theoretic approach to distributed control over networks
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
John Swigart, Sanjay Lall
COMBINATORICA
2010
13 years 7 months ago
Formulae and growth rates of high-dimensional polycubes
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...
Ronnie Barequet, Gill Barequet, Günter Rote
FSTTCS
2007
Springer
14 years 4 months ago
Triangulations of Line Segment Sets in the Plane
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
Mathieu Brévilliers, Nicolas Chevallier, Do...
PROCEDIA
2010
67views more  PROCEDIA 2010»
13 years 8 months ago
Using the feasible set method for rezoning in ALE
One of the steps in the Arbitrary Lagrangian Eulerian (ALE) algorithm is the improvement of the quality of the computational mesh. This step, commonly referred to as rezoning, is ...
Markus Berndt, Milan Kucharik, Mikhail J. Shashkov