477 search results - page 59 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
ICASSP
2011
IEEE
13 years 17 days ago
2011
IEEE
We investigate in this paper the anchor selection problem with consideration of anchor location uncertainty, which arises naturally from error propagation problem in successive or...
MST
2011
13 years 3 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
STOC
1993
ACM
14 years 28 days ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
AI
2005
Springer
13 years 8 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...