282 reputation
26
bio website loyc-etc.blogspot.com
location Alberta, Canada
age
visits member for 2 years, 7 months
seen Feb 19 at 2:08

Mar
7
awarded  Necromancer
Jan
19
comment Labeling algorithm for points
Thanks. Since I couldn't find much info on this subject, I decided (before your reply) to implement a simple, if slightly braindead, overlap-avoidance strategy, coupled with a user interface so that the user can manually reposition labels. Figure 1 in your paper is impressive--I was lucky to have figured out where to click on CiteSeer to download it.
Dec
27
awarded  Student
Dec
24
awarded  Tumbleweed
Dec
17
comment Language parsing to find important words
I don't understand from the question what you're trying to accomplish. For the first example in particular, the words "Keurig" and "afford" could be identified by a simple statistical check: among the words of the sentence, these two words are less common in English than the others. So if you had a database of word frequencies, you could identify those words easily.
Dec
17
asked Labeling algorithm for points
Nov
18
awarded  Yearling
May
15
comment Linking in code comments (to other unique anchors/comments)
As far as I can tell, Visual Studio 2010 has no built-in ability to follow <see cref="..."/> links in those comments.
May
15
answered Linking in code comments (to other unique anchors/comments)
May
15
comment Is this awkward spacing some type of style?
A similar style is used by the Microsoft (Dinkumware) STL. Actually I'd say the Dinkumware style is worse, since things that other coders would write as a single line of code are broken up into several lines of code with weird indentation in the sub-lines.
May
9
comment When programmers talk about “data structures”, what are they referring to?
I don't think I've ever heard someone refer to an int as a "data structure".
May
8
comment Are trees organised by a “firstchild, nextsibling” structure? If not, why not?
For example: a B+tree would never use this "firstchild, nextsibling" structure. It would be inefficient to the point of absurdity for a disk-based tree, and still very inefficient for a memory-based tree. An in-memory R-tree could tolerate this structure, but it would still imply a lot more cache-misses. I am hard-pressed to think of a situation where "firstchild, nextsibling" would be superior. Well, yeah, it could work for a syntax tree as ammoQ mentioned. Anything else?
May
8
comment Where are null values stored, or are they stored at all?
((void*)0) is indeed almost always stored as 0; I don't personally know of a platform where it is not stored as 0. I imagine it would make sense on systems with very tiny memory sizes, where you wouldn't want to waste a byte or two by not storing anything at location 0... in that case ((void*)0) might use an all-1s bit pattern instead. But then, I wonder what happens if you convert a pointer to an integer. Would casting support round-tripping? How would that work?
May
8
awarded  Commentator
May
1
comment Is premature optimization really the root of all evil?
BTW, insertion sort is just as simple as bubble sort, is never slower and often faster, so I don't know why anyone would talk about bubble sort at all. Quick sort is a little more complicated and difficult to get right (my high school class was assigned to write a quick sort... and not one of us students got it right on our first try), but now that all standard libraries have one, there's little excuse not to use it. Btw, don't write a quick sort yourself, it's too easy to write a quicksort that runs in O(N^2) time on sorted data or data with many duplicate items.
May
1
revised Is premature optimization really the root of all evil?
added 543 characters in body
May
1
revised Is premature optimization really the root of all evil?
added 543 characters in body
May
1
revised Is premature optimization really the root of all evil?
added 543 characters in body
May
1
revised Is premature optimization really the root of all evil?
added 356 characters in body
May
1
answered Is premature optimization really the root of all evil?