Sciweavers

Share ➚
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
10 years 6 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
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 »
Explore & Download
Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
Productivity Tools
International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
Document Tools
PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
Image Tools
JPG to PS JPG to PDF Extract Images from PDF Image Converter
Sciweavers
About Community Report Bug Request Feature Cookies Privacy Policy Terms of Use Contact

Copyright © 2009-2011 Sciweavers LLC. All rights reserved.

books