2022 search results - page 84 / 405 » Complexity of Non-Monotonic Logics |
103
click to vote
ACMSE
2000
ACM
15 years 5 months ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
157
click to vote
CC
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
PODS
2007
ACM
16 years 25 days 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 ...
ISCAS
2006
IEEE
15 years 6 months ago
2006
IEEE
— Quadrature Σ∆ ADCs require a feedback path for both the I and the Q part of the complex feedback signal. If two separated multibit feedback DACs are used, mismatch among the...
122
click to vote
CORR
2006
Springer
15 years 22 days ago
2006
Springer
RFID technology is gaining adoption on an increasing scale for tracking and monitoring purposes. Wide deployments of RFID devices will soon generate an unprecedented volume of dat...