1651 search results - page 24 / 331 » Measuring the Complexity of Classification Problems |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
ALIFE
2008
13 years 7 months ago
2008
While complex systems have been studied now for more than two decades, there still is no agreement on what complexity actually is. This lack of a definition might be a problem when...
NN
2006
Springer
13 years 7 months ago
2006
Springer
In a number of engineering problems, e.g. in geotechnics, petroleum engineering, etc. intervals of measured series data (signals) are to be attributed a class maintaining the cons...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Real-word applications often involve a binary hypothesis testing problem with one of the two hypotheses ill-defined and hard to be characterized precisely by a single measure. In ...