Sciweavers

604 search results - page 1 / 121
» The Hardness of Metric Labeling
Sort
View
FOCS
2004
IEEE
13 years 8 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
13 years 10 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket
IAT
2009
IEEE
13 years 8 months ago
Confusion and Distance Metrics as Performance Criteria for Hierarchical Classification Spaces
When intelligent systems reason about complex problems with a large hierarchical classification space it is hard to evaluate system performance. For classification problems, differ...
Wilbert van Norden, Catholijn M. Jonker
SEFM
2007
IEEE
13 years 10 months ago
Hardness for Explicit State Software Model Checking Benchmarks
Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their per...
Neha Rungta, Eric G. Mercer
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 5 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy