Sciweavers

1146 search results - page 140 / 230
» Finite cupping sets
Sort
View
CDC
2009
IEEE
136views Control Systems» more  CDC 2009»
15 years 10 months ago
Verification of K-step opacity and analysis of its complexity
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on ...
Anooshiravan Saboori, Christoforos N. Hadjicostis
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
15 years 10 months ago
Optimality of affine policies in multi-stage robust optimization
In this paper, we show the optimality of a certain class of disturbance-affine control policies in the context of one-dimensional, constrained, multi-stage robust optimization. Ou...
Dimitris Bertsimas, Dan Andrei Iancu, Pablo A. Par...
ECML
2007
Springer
15 years 10 months ago
Ordinal Classification with Decision Rules
We consider the problem of ordinal classification, in which a value set of the decision attribute (output, dependent variable) is finite and ordered. This problem shares some chara...
Krzysztof Dembczynski, Wojciech Kotlowski, Roman S...
HPCS
2009
IEEE
15 years 10 months ago
FFT-Based Dense Polynomial Arithmetic on Multi-cores
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
Marc Moreno Maza, Yuzhen Xie
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
15 years 10 months ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...