Sciweavers

112 search results - page 15 / 23
» Neighborhood based fast graph search in large networks
Sort
View
88
Voted
CIKM
2009
Springer
15 years 4 months ago
P-Rank: a comprehensive structural similarity measure over information networks
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
Peixiang Zhao, Jiawei Han, Yizhou Sun
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 2 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
SAMT
2007
Springer
171views Multimedia» more  SAMT 2007»
15 years 3 months ago
SAPIR: Scalable and Distributed Image Searching
—In this paper we present a scalable and distributed system for image retrieval based on visual features and annotated text. This system is the core of the SAPIR project. Its arc...
Fabrizio Falchi, Mouna Kacimi, Yosi Mass, Fausto R...
PVLDB
2010
220views more  PVLDB 2010»
14 years 4 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
DAC
2005
ACM
14 years 11 months ago
Partitioning-based approach to fast on-chip decap budgeting and minimization
This paper proposes a fast decoupling capacitance (decap) allocation and budgeting algorithm for both early stage decap estimation and later stage decap minimization in today’s ...
Hang Li, Zhenyu Qi, Sheldon X.-D. Tan, Lifeng Wu, ...