|
|
|
google unix.com
|
|||||||
| Forums | Register | Forum Rules | Links | Albums | FAQ | Members List | Calendar | Search | Today's Posts | Mark Forums Read |
| High Level Programming Post questions about C, C++, Java, SQL, and other programming languages here. |
More UNIX and Linux Forum Topics You Might Find Helpful
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| how to get the process data structure through pid? | billconan | High Level Programming | 2 | 01-19-2009 08:52 AM |
| tree structure of the data | ThobiasVakayil | Shell Programming and Scripting | 2 | 03-27-2008 01:15 AM |
| How to implement an on-disk data structure | the_learner | High Level Programming | 1 | 08-10-2007 01:56 AM |
| inode data structure | anwerreyaz | Filesystems, Disks and Memory | 4 | 11-20-2006 02:34 AM |
| what data structure for polinomial | xli3 | High Level Programming | 0 | 10-07-2002 04:27 PM |
 |
Powered by 
|
|
|
LinkBack | Thread Tools | Search this Thread | Rate Thread | Display Modes |
|
|
10-25-2009
|
||||
|
||||
|
Conpressed, Direct Child Info, Word Tracking, Lexicon Data Structure, ADTDAWG?
Hello,
Back in late August 2009, I decided to start working on a modification of the traditional Directed Acyclic Word Graph data structure. End Of Word Nodes did not match up with single words, and Child Information had to be discovered through list scrolling. These were a heavy price to pay for a small data structure. I made a series of observations that led me to the ADTDAWG. - The Adamovsky Direct Tracking Directed Acyclic Word Graph - I documented the project with full disclosure on the web page below... Adamovsky Direct Tracking Directed Acyclic Word Graph - An Advanced Lexicon Data Structure The construct has proved its value in a series of rigorous tests that I designed for it. Do you have any comments about the structure? All the Best, HeavyJ |
|
| Bookmarks |
| Tags |
| dawg, graph, lexicon, tracking, word |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
Hybrid Mode
