2080 search results - page 46 / 416 » Measuring empirical computational complexity |
PVLDB
2010
13 years 4 months ago
2010
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
ICCV
2011
IEEE
12 years 10 months ago
2011
IEEE
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
COCO
1995
Springer
14 years 1 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
NIPS
2000
13 years 11 months ago
2000
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
PKDD
2004
Springer
14 years 3 months ago
2004
Springer
One of the most important operations involving Data Mining patterns is computing their similarity. In this paper we present a general framework for comparing both simple and comple...