2836 search results - page 168 / 568 » Parsing Algorithms and Metrics |
WWW
2010
ACM
14 years 3 months ago
2010
ACM
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— Service composition enables flexible creation of new services by assembling independent service components. We are focused on the scenario where such composition takes place a...
APPROX
2000
Springer
14 years 14 days ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper we present a novel method for parsing aerial images with a hierarchical and contextual model learned in a statistical framework. We learn hierarchies at the scene an...