2976 search results - page 379 / 596 » On the bounded integer programming |
166
click to vote
ANOR
2011
14 years 11 months ago
2011
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
176
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
140
click to vote
WABI
2009
Springer
15 years 11 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
163
Voted
ICNSC
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, a variance constrained filtering problem is considered for systems with both non-Gaussian noises and polytopic uncertainty. A novel filter is developed to estimate t...
125
click to vote
FORMATS
2007
Springer
15 years 10 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...