Sciweavers

1071 search results - page 134 / 215
» Programming with enumerable sets of structures
Sort
View
125
Voted
CORR
2010
Springer
198views Education» more  CORR 2010»
14 years 9 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
CGA
1998
15 years 8 days ago
Principles for Information Visualization Spreadsheets
ns, with large, abstract, multidimensional data sets that are visually represented in multiple ways. We illustrate how spreadsheet techniques provide a structured, intuitive, and p...
Ed Huai-hsin Chi, John Riedl, Phillip Barry, Josep...
82
Voted
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
15 years 3 months ago
Output-feedback controlled-invariant polyhedra for constrained linear systems
Abstract— A design method is proposed for outputfeedback control of linear systems subject to state and control constraints, additive disturbances and measurement noise. First, n...
Carlos Eduardo Trabuco Dórea
JMLR
2012
13 years 3 months ago
On Sparse, Spectral and Other Parameterizations of Binary Probabilistic Models
This paper studies issues relating to the parameterization of probability distributions over binary data sets. Several such parameterizations of models for binary data are known, ...
David Buchman, Mark W. Schmidt, Shakir Mohamed, Da...
93
Voted
CSL
2004
Springer
15 years 6 months ago
A Dependent Type Theory with Names and Binding
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
Ulrich Schöpp, Ian Stark