Find Jobs
Hire Freelancers

Build a HD-Tree: An Efficient High-Dimensional Virtual Index Structure Using a Half Decomposition Strategy

$10-30 USD

Closed
Posted about 3 years ago

$10-30 USD

Paid on delivery
HD-tree is an improvement on D-tree indexing method. Both structures combine quadtree-like partitioning using integer shift operations without storing internal nodes, but only leaves. More description is given in the attached pdf document.
Project ID: 29405086

About the project

1 proposal
Remote project
Active 3 yrs ago

Looking to make some money?

Benefits of bidding on Freelancer

Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs
1 freelancer is bidding on average $30 USD for this job
User Avatar
Hi there, I have read your project description and I am confident about your project I can do perfectly. Please leave a message on my chat so we can discuss the budget and deadline of the project. Thanks. regard , faizan
$30 USD in 1 day
4.8 (5 reviews)
3.4
3.4

About the client

Flag of UNITED STATES
Edwardsville, United States
0.0
0
Payment method verified
Member since Oct 11, 2019

Client Verification

Other jobs from this client

C++ code which uses recursion
$10-30 USD
Thanks! We’ve emailed you a link to claim your free credit.
Something went wrong while sending your email. Please try again.
Registered Users Total Jobs Posted
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Loading preview
Permission granted for Geolocation.
Your login session has expired and you have been logged out. Please log in again.