855 search results - page 73 / 171 » Complexity of Equations over Sets of Natural Numbers |
DBPL
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— We consider a wireless multiuser network where a number of source/destination pairs communicate concurrently over the same physical channel. A set of amplify-and-forward relay ...
3DPVT
2002
IEEE
15 years 2 months ago
2002
IEEE
We present a surface compression method that stores surfaces as wavelet-compressed signed-distance volumes. Our approach enables the representation of surfaces with complex topolo...
SIGSOFT
1998
ACM
15 years 2 months ago
1998
ACM
This paper reports on an empirical evaluation of the fault-detecting ability of two white-box software testing techniques: decision coverage (branch testing) and the all-uses data...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...