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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
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
42
click to vote
ICDE
2012
IEEE
240
views
Database
»
more
ICDE 2012
»
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
11 years 11 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 »