1204 search results - page 153 / 241 » Termination of Polynomial Programs |
ICDE
2008
IEEE
15 years 7 months ago
2008
IEEE
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
103
click to vote
CAEPIA
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
96
Voted
STOC
1993
ACM
15 years 4 months ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...