amallia

8 ms·

31.
Show HN: Pisa – Probably the Fastest Full Text Search Engine Written in C++(github.com)
4 points by amallia 7y ago|0 comments
32.
Performant Indexes and Search for Academia v0.6.3(github.com)
1 points by amallia 7y ago|0 comments
33.
Everything You Always Wanted to Know About Search (But Were Afraid to Ask)(youtube.com)
1 points by amallia 7y ago|0 comments
34.
Everything You Always Wanted to Know About Search (But Were Afraid to Ask)(youtube.com)
1 points by amallia 7y ago|0 comments
35.
Performant Indexes and Search for Academia v0.5.0(github.com)
1 points by amallia 7y ago|0 comments
36.
An attempt to write a better search engine for experimentation in text retrieval(github.com)
3 points by amallia 7y ago|0 comments
37.
An attempt to write a better search engine for experimentation in text retrieval(github.com)
2 points by amallia 7y ago|0 comments
38.
Awesome Italian Tech (PRs welcome)(github.com)
2 points by amallia 8y ago|0 comments
39.
Variable-length integer encoding library using a little-endian representation(github.com)
1 points by amallia 8y ago|0 comments
40.
A better C++ assertion library which also prints a debug message(github.com)
2 points by amallia 8y ago|1 comments
41.
Variable-length integer encoding library using a little-endian representation(github.com)
2 points by amallia 8y ago|0 comments
42.
A better C++ assertion library which also prints a debug message(github.com)
3 points by amallia 8y ago|0 comments
43.
A better C++ assertion library which also prints a debug message(github.com)
1 points by amallia 8y ago|1 comments
44.
On implementing k Nearest Neighbor for regression in Python(antoniomallia.it)
1 points by amallia 9y ago|0 comments
45.
On implementing k Nearest Neighbor for regression in Python(antoniomallia.it)
2 points by amallia 9y ago|0 comments
46.
On implementing k Nearest Neighbor for regression in Python(antoniomallia.it)
6 points by amallia 9y ago|0 comments
47.
by amallia 9y ago
Thanks for pointing out! This is a blog post for people that know already a bit about the theory and are interested in a possible implementation. But I see your point and will add it.
48.
by amallia 9y ago
If you have a bag of [1.0 3.1 5.2 7.8 7.8 7.9 8.1 8.2 9.9 10.1] what is the probability of picking 8.0? It is definitely higher then 1.1, isn't it? I hope this clarifies the pdf usage.
49.
by amallia 9y ago
I honestly couldn't find many implementations of Naive Bayes out there. The famous ones are over engineered to use it as a learning too. I think people appreciate the fact that an article like this for its step-by-step approach.
50.
by amallia 9y ago
Thank you dude!
51.
Implementing a Gaussian Naive Bayes Classifier in Python(antoniomallia.it)
92 points by amallia 9y ago|20 comments
52.
Sorted integers compression with Elias-Fano encoding(antoniomallia.it)
1 points by amallia 9y ago|0 comments
53.
Sorted integers compression with Elias-Fano encoding(antoniomallia.it)
2 points by amallia 9y ago|0 comments
54.
by amallia 9y ago
I can't see how an algorithm to lookup bit 'i' in a compressed bitmap of size 'n' can ever be constant time. What you do is decoding a block in constant time, as the block size is constant and you need exact
55.
by amallia 9y ago
Using double here seems to be unsuitable for this kind of algorithm. Agreed! But for the purpose of the post it is fine to use boost. Doing a constexpr function is definitely a plus for a production implementation. Also I don&#
56.
by amallia 9y ago
You are absolutely right! Will fix. Thanks for the feedback
57.
by amallia 9y ago
Roaring Bitmaps is for sure another big thing out there. I will definitely write about it soon.
58.
On-the-fly encoding and decoding of bitmaps(antoniomallia.it)
34 points by amallia 9y ago|14 comments