|
-
February 19th, 2015, 06:59 AM
#8
Re: algorithm for grouping different elements from multi dimensional matrix
 Originally Posted by ahlandberg
Thanks , it makes sense but I need to let it sink in ....
Sure, the algorithm I suggested will solve the problem but not necessarily in the most efficient way. Also there are quite a few details left such as for example,
1. How to check for BC in the most efficient manner for big buckets and lots of dimensions.
2. How to efficiently generate all BC E-subsets (*) of an S set.
Feel free to ask. Good luck!
(*) I mistakingly called it an M-subset in my first reply but I've corrected that. It should be E-subset where E is the size of a bucket.
Last edited by razzle; February 19th, 2015 at 07:06 AM.
Tags for this Thread
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|
Reply With Quote
