604 search results - page 10 / 121 » The Hardness of Metric Labeling |
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
LREC
2008
13 years 9 months ago
2008
We evaluate discriminative parse reranking and parser self-training on a new English test set using four versions of the Charniak parser and a variety of parser evaluation metrics...
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
Semi-supervised image segmentation is an important issue in many image processing applications, and has been a popular research area recently, the most popular are graph-based met...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
PVLDB
2010
13 years 6 months ago
2010
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...