604 search results - page 36 / 121 » The Hardness of Metric Labeling |
FOSSACS
2003
Springer
14 years 1 months ago
2003
Springer
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...
CVPR
2010
IEEE
14 years 10 days ago
2010
IEEE
This paper presents a codebook learning approach for image classification and retrieval. It corresponds to learning a weighted similarity metric to satisfy that the weighted simil...
DAGSTUHL
2006
13 years 9 months ago
2006
-- During the last 20 years, complexity has been an interesting topic that has been investigated in many fields of science, such as biology, neurology, software engineering, chemis...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
SOFTVIS
2006
ACM
14 years 1 months ago
2006
ACM
Visual paradigms such as node-link diagrams are well suited to the representation of Semantic Web data encoded with the Resource Description Framework (RDF), whose data model can ...