211 search results - page 9 / 43 » BoostMap: A Method for Efficient Approximate Similarity Rank... |
FAW
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
AMDO
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In this paper, we present a novel, fast, resolution-independent silhouette area-based matching approach. We approximate the silhouette area by a small set of axis-aligned...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
ECCV
2010
Springer
14 years 26 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...