Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
71
search results - page 15 / 15
»
Compressing Large Signature Trees
Sort
relevance
views
votes
recent
update
View
thumb
title
161
click to vote
ICDE
2012
IEEE
240
views
Database
»
more
ICDE 2012
»
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
13 years 5 months ago
Download
www.se.cuhk.edu.hk
—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
claim paper
Read More »
« Prev
« First
page 15 / 15
Last »
Next »