1772 search results - page 84 / 355 » Classifying Problems into Complexity Classes |
111
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Applications of semantic technologies often require the representation of and reasoning with structured objects--that is, objects composed of parts connected in complex ways. Alth...
108
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
114
Voted
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
125
Voted
STACS
2009
Springer
15 years 9 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...
115
Voted
AIPS
2008
15 years 4 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...