3708 search results - page 702 / 742 » Approximating Betweenness Centrality |
92
Voted
WISE
2002
Springer
15 years 5 months ago
2002
Springer
In recent years, several information retrieval methods using information about the Web-links are developed, such as HITS and Trawling. In order to analyze the Web-links dividing i...
117
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
114
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
108
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
125
click to vote
TAMC
2009
Springer
15 years 5 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...