29908 search results - page 158 / 5982 » On the Complexity of |
158
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
204
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Let Fq be a finite field and consider an extension Fqn where an optimal normal element exists. Using the trace of an optimal normal element in Fqn , we provide low complexity norma...
177
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
204
click to vote
SSDBM
2009
IEEE
16 years 1 months ago
2009
IEEE
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
190
click to vote
KBSE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Test coverage such as branch coverage is commonly measured to assess the sufficiency of test inputs. To reduce tedious manual efforts in generating high-covering test i...