239 search results - page 9 / 48 » Localized Upper and Lower Bounds for Some Estimation Problem... |
FOCS
1990
IEEE
15 years 1 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
JMLR
2012
13 years 1 days ago
2012
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...