Sciweavers

447 search results - page 59 / 90
» Re-ranking search results using document-passage graphs
Sort
View
ECCV
2008
Springer
15 years 11 months ago
Image Segmentation by Branch-and-Mincut
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
Victor S. Lempitsky, Andrew Blake, Carsten Rother
ICITA
2005
IEEE
15 years 3 months ago
Partition-Based Parallel PageRank Algorithm
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
Arnon Rungsawang, Bundit Manaskasemsak
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 4 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
IV
2005
IEEE
178views Visualization» more  IV 2005»
15 years 3 months ago
Capturing Team Dynamics through Temporal Social Surfaces
This paper introduces Temporal Social Surfaces. Temporal Social Surfaces show the dynamic evolution of social relationships in groups. Changes in measures of social network analys...
Peter A. Gloor
ML
2000
ACM
150views Machine Learning» more  ML 2000»
14 years 9 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew