1651 search results - page 178 / 331 » Measuring the Complexity of Classification Problems |
INTERACTION
2009
ACM
14 years 2 months ago
2009
ACM
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
CVDB
2004
ACM
14 years 1 months ago
2004
ACM
Browsing large multimedia databases is becoming a challenging problem, due to the availability of great amounts of data and the complexity of retrieval. In this paper we propose a...
APAL
2010
13 years 8 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
JDA
2008
13 years 8 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
WINET
2002
13 years 7 months ago
2002
The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic framework. Shannon's entropy measure is identif...