Sciweavers

2181 search results - page 358 / 437
» The restriction scaffold problem
Sort
View
ALGORITHMICA
2011
13 years 3 months ago
Crossing Numbers of Graphs with Rotation Systems
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
CDC
2010
IEEE
145views Control Systems» more  CDC 2010»
13 years 3 months ago
Multivariable frequency domain identification using IV-based linear regression
Abstract-- Identification of output error models from frequency domain data generally results in a non-convex optimization problem. A well-known method to approach the output error...
Rogier S. Blom, Paul M. J. Van den Hof
CDC
2010
IEEE
140views Control Systems» more  CDC 2010»
13 years 3 months ago
On the observability of linear systems from random, compressive measurements
Abstract-- Recovering or estimating the initial state of a highdimensional system can require a potentially large number of measurements. In this paper, we explain how this burden ...
Michael B. Wakin, Borhan Molazem Sanandaji, Tyrone...
ECCC
2011
183views ECommerce» more  ECCC 2011»
13 years 3 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
JAIR
2011
123views more  JAIR 2011»
13 years 3 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...