Sciweavers

855 search results - page 73 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
DBPL
2009
Springer
144views Database» more  DBPL 2009»
16 years 23 days ago
General Database Statistics Using Entropy Maximization
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...
Raghav Kaushik, Christopher Ré, Dan Suciu
ICC
2007
IEEE
16 years 16 days ago
Optimizing Zero-Forcing Based Gain Allocation for Wireless Multiuser Networks
— 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 ...
Celal Esli, Stefan Berger, Armin Wittneben
3DPVT
2002
IEEE
145views Visualization» more  3DPVT 2002»
15 years 11 months ago
Multiresolution Distance Volumes for Progressive Surface Compression
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...
Daniel E. Laney, Martin Bertram, Mark A. Duchainea...
SIGSOFT
1998
ACM
15 years 10 months ago
Further Empirical Studies of Test Effectiveness
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...
Phyllis G. Frankl, Oleg Iakounenko
STACS
2010
Springer
16 years 1 months ago
Branching-time Model Checking of One-counter Processes
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...
Stefan Göller, Markus Lohrey