459 search results - page 14 / 92 » Computational Complexity of Probabilistic Disambiguation |
CCGRID
2003
IEEE
15 years 5 months ago
2003
IEEE
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
114
click to vote
CSR
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
279
click to vote
PODS
2009
ACM
16 years 7 days ago
2009
ACM
Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also ...
CPC
1998
14 years 11 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
127
click to vote
TOG
2012
13 years 2 months ago
2012
We present an approach to synthesizing shapes from complex domains, by identifying new plausible combinations of components from existing shapes. Our primary contribution is a new...