A paper [1] we wrote in 2015 (cited by the authors) uses some more sophisticated data structures (compressed suffix trees) and Kneser–Ney smoothing to get the same "unlimited" context. I imagine with better smoothing…
LADWP (LA power provider) has a similar opt-in program for Nest owners with the following conditions: How the program works * We’ll adjust your connected thermostat(s) when summer electricity demand is at its highest to…
I find the requirement of using a laptop without being allowed to use an external monitor to view potentially very long documents (half screen!) for hours on a tiny screen to be ridiculous.
Looking at the paper, comparing methods that use k bits per hash to a method that uses k*log(m) bits per hash seems unfair and misleading.
Funny enough "learning characters/words in the context of the vocabulary they are in" is exactly what NLP machine learning models use to learn "rich" word/text representations based on the "distribution hypothesis"…
Like the requirement that you have to delete tweets in datasets that have been deleted on twitter?
I'm pretty sure all the twitter datasets violate the twitter TOCs.
From the first link: "Comparing OFDM to LTE today we find a better scalability to a much lower latency (an order of magnitude lower round-trip time [RTT] than LTE today) in OFDM." Doesn't LTE already have quite good…
Hetzner is involved in many of the non-related entity transfers.
I thought the NVIDIA drivers for the more fancy cards (TITAN etc) are the same as for the gforce cards. Wouldn't this restriction apply to those cards as well? Doesn't make much sense to me...
> I find it hard to believe this. Their main index is certainly not all-RAM (there must be some flash and maybe even disk), and the throughput would just not be enough for something like BitFunnel. From looking at the…
Is there a binary version of this tool that can be downloaded somewhere? Seems a bit of a pain to install.
There are much faster SA construction algorithms than skew (check out divsufsort). The O(n) algorithms using induced sorting are also likely much faster than this work. The constants of recent O(n) algorithms are very…
I think china blocks zh.wikipedia.org but all other languages are not blocked.
There is a paper describing such a method (not sure if that is what was implemented): "Zhongjun Jin, Michael R. Anderson, Michael J. Cafarella, H. V. Jagadish: Foofah: Transforming Data By Example. SIGMOD Conference…
In general the techniques in zstd/lzma are much faster than using compressed text indexes. As a somewhat expert in the field I doubt that this paper has any practical implications.
Say you want to translate a sentence from language A to language B. You have a system that generates 10 possible translations in language B. Now you use a language model of language B to figure out which is the best…
There was a post on HN a while ago where somebody wrote a server side tool which can detect curl -> bash piping and delivered different content if that happens.
What about AVM products such as a Fritzbox (https://en.wikipedia.org/wiki/Fritz!Box) ? Primarily a german product but also available internationally (e.g. Australia)
Interestingly, there is a discussion in comments of this paper claiming the authors got it wrong. But as you said, under the assumption that the test perfectly detects, the results are correct.
Indeed. I was never aware that he was working on his own text editor.
Lots of Australian ISPs use this model. For example: TPG Broadband Off-Net 50GB -> 10GB peak / 40GB off peak (2am-8am)
We are working on VS support. Last time we tried to port to VS some of the constexpr stuff we use was not available yet. The next release (in 1-2 month) should have full VS2015 support.
Thanks for clarifying this.
The library is very template heavy and thus most of the code is in the header files so I guess it wouldn't change much in this case? Additionally, we (the main authors) have lots of contributions from other researchers…
A paper [1] we wrote in 2015 (cited by the authors) uses some more sophisticated data structures (compressed suffix trees) and Kneser–Ney smoothing to get the same "unlimited" context. I imagine with better smoothing…
LADWP (LA power provider) has a similar opt-in program for Nest owners with the following conditions: How the program works * We’ll adjust your connected thermostat(s) when summer electricity demand is at its highest to…
I find the requirement of using a laptop without being allowed to use an external monitor to view potentially very long documents (half screen!) for hours on a tiny screen to be ridiculous.
Looking at the paper, comparing methods that use k bits per hash to a method that uses k*log(m) bits per hash seems unfair and misleading.
Funny enough "learning characters/words in the context of the vocabulary they are in" is exactly what NLP machine learning models use to learn "rich" word/text representations based on the "distribution hypothesis"…
Like the requirement that you have to delete tweets in datasets that have been deleted on twitter?
I'm pretty sure all the twitter datasets violate the twitter TOCs.
From the first link: "Comparing OFDM to LTE today we find a better scalability to a much lower latency (an order of magnitude lower round-trip time [RTT] than LTE today) in OFDM." Doesn't LTE already have quite good…
Hetzner is involved in many of the non-related entity transfers.
I thought the NVIDIA drivers for the more fancy cards (TITAN etc) are the same as for the gforce cards. Wouldn't this restriction apply to those cards as well? Doesn't make much sense to me...
> I find it hard to believe this. Their main index is certainly not all-RAM (there must be some flash and maybe even disk), and the throughput would just not be enough for something like BitFunnel. From looking at the…
Is there a binary version of this tool that can be downloaded somewhere? Seems a bit of a pain to install.
There are much faster SA construction algorithms than skew (check out divsufsort). The O(n) algorithms using induced sorting are also likely much faster than this work. The constants of recent O(n) algorithms are very…
I think china blocks zh.wikipedia.org but all other languages are not blocked.
There is a paper describing such a method (not sure if that is what was implemented): "Zhongjun Jin, Michael R. Anderson, Michael J. Cafarella, H. V. Jagadish: Foofah: Transforming Data By Example. SIGMOD Conference…
In general the techniques in zstd/lzma are much faster than using compressed text indexes. As a somewhat expert in the field I doubt that this paper has any practical implications.
Say you want to translate a sentence from language A to language B. You have a system that generates 10 possible translations in language B. Now you use a language model of language B to figure out which is the best…
There was a post on HN a while ago where somebody wrote a server side tool which can detect curl -> bash piping and delivered different content if that happens.
What about AVM products such as a Fritzbox (https://en.wikipedia.org/wiki/Fritz!Box) ? Primarily a german product but also available internationally (e.g. Australia)
Interestingly, there is a discussion in comments of this paper claiming the authors got it wrong. But as you said, under the assumption that the test perfectly detects, the results are correct.
Indeed. I was never aware that he was working on his own text editor.
Lots of Australian ISPs use this model. For example: TPG Broadband Off-Net 50GB -> 10GB peak / 40GB off peak (2am-8am)
We are working on VS support. Last time we tried to port to VS some of the constexpr stuff we use was not available yet. The next release (in 1-2 month) should have full VS2015 support.
Thanks for clarifying this.
The library is very template heavy and thus most of the code is in the header files so I guess it wouldn't change much in this case? Additionally, we (the main authors) have lots of contributions from other researchers…