457 search results - page 27 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
136
click to vote
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
We derive lower and upper bounds for the size of a hyperoval of a finite polar space of rank r {2, 3}. We give a computer-free proof for the uniqueness, up to isomorphism, of the...
156
click to vote
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
194
click to vote
ICSOC
2009
Springer
15 years 3 months ago
2009
Springer
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically i...
157
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
194
click to vote
ECCC
2010
15 years 4 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...