marcuslager

8 ms·

31.
by marcuslager 9y ago
You can remove "mistakes" like that from your Google history pretty easily.
32.
by marcuslager 9y ago
How is Google search not already sentiment as a service? It compares page relevance partly from sentiment analysis. What did you have in mind? A text box and a submit your url button? Or something more elaborate?
33.
In response to Ayende’s code review of Resin, part I(medium.com)
3 points by marcuslager 9y ago|0 comments
34.
by marcuslager 9y ago
There is no such disadvantage. Scoring usually comes after the index (tree) lookup. Once you have terms you can weight them. The trie is just a lookup mechanism.
35.
by marcuslager 9y ago
I'm a n00b and postgres vacuum was news to me. Can I ask, in a postgres cluster with high traffic, how do you manage the nodes? Do you take them offline before starting a vacuum process?
36.
by marcuslager 9y ago
Can I have your email address? I just need to send you something. Nothing fishy.
37.
by marcuslager 9y ago
If they have js enabled they already did.
38.
by marcuslager 9y ago
>the client would download the index That doesn't sound like too bad of an idea, given the state of js these days. Yes, you can cut off irrelevant terms, those with low tf-idf score (the, a, is, are...) or you could filter out stopw
39.
When you need a reality check, who are you going to call?(medium.com)
2 points by marcuslager 9y ago|0 comments
40.
Show HN: DocumentTable – a specialized file for document db operations(github.com)
2 points by marcuslager 9y ago|0 comments
41.
by marcuslager 9y ago
For a good discussion, instead of looking at the problem strictly programmatically, you could look at it as something you could map in vector space. The dimensions of appointments are [startTime, endTime, location]. If you have points in on
42.
by marcuslager 9y ago
To have a good chat I would hope they drew a coordinate system, mapped both appointments in Euclidian space, and then did an intersect between vector A (first appointment) and vector B (second appointment) to see if there are any data point
43.
by marcuslager 9y ago
I have read some of your documentation and your blog post. Your tech seems strong. But what is it about it that you feel is so unique that you cannot share it with the world? Is it the succinct trie implementation? The tree traversal algori
44.
In-memory full-text index vs. disk-based trie(medium.com)
2 points by marcuslager 9y ago|0 comments