Sciweavers

2412 search results - page 20 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
3DPVT
2004
IEEE
126views Visualization» more  3DPVT 2004»
14 years 1 months ago
Helmholtz Stereopsis on Rough and Strongly Textured Surfaces
Helmholtz Stereopsis (HS) has recently been explored as a promising technique for capturing shape of objects with unknown reflectance. So far, it has been widely applied to object...
Jean-Yves Guillemaut, Ondrej Drbohlav, Radim S&aac...
SECURWARE
2008
IEEE
14 years 4 months ago
Polynomial Heuristic Algorithms for Inconsistency Characterization in Firewall Rule Sets
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael M. Ga...
PODS
2009
ACM
100views Database» more  PODS 2009»
14 years 10 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
CSL
2007
Springer
14 years 4 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 11 months ago
Blocking parameterizations for improving the computational tractability of affine disturbance feedback MPC problems
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
Frauke Oldewurtel, Ravi Gondhalekar, Colin Neil Jo...