nauful

4 ms·

1.
by nauful 2y ago
SEEKING WORK | TX | Remote Technologies: - NLP development, including local LLMs, GPT, BERT, Pinecone, Langchain, LSTM, vector databases, sentence transformers and summarizers. - C# and .NET development, including SQL Server, Entity Framewo
2.
by nauful 2y ago
Location: TX Remote: Yes Willing to relocate: No Technologies: - NLP development, including local LLMs, GPT, BERT, Pinecone, Langchain, LSTM, vector databases, sentence transformers and summarizers. - C# and .NET development, including SQL
3.
by nauful 3y ago
It's a simplification algorithm for a series of points. Briefly, if you have a group of several points relatively close to a straight line between the first and last point in the group, all of the middle points may be removed. Given a
4.
by nauful 3y ago
I have a hard time understanding the question as you phrased it. Tested with guanaco-33B and a cleaner question, looks like a much better response: > How can I join a column with SQL in Postgres to a string separated with a comma? You ca
5.
by nauful 4y ago
Depending on the technology used it may be trivial to extremely difficult. For most additive geometry constructed maps, cracks can form to create collision holes which otherwise look solid, or the map may not be entirely closed and have a g
6.
by nauful 4y ago
You have to clip against planes in 4D space (xyzw) before perspective divide (xyz /= w), not 3D (xyz). This simplified sample shows Sutherland-Hodgman with 4D clipping: https://web.archive.org/web/20040713023730&#x
7.
by nauful 5y ago
This is my second real-time emulator, first was a GBA emulator written in C++. It's generally an enjoyable experience if you're looking to write an emulator. GB hardware is very simple compared to other systems, Z80-style CPU + si
8.
Show HN: A browser-based Gameboy emulator written in TypeScript(github.com)
7 points by nauful 5y ago|2 comments
9.
by nauful 6y ago
I've had to disassemble client applications several times to investigate issues with server compatibility when generic error codes and crashes don't give me any hints. Network debuggers don't help when the issue is caused by
10.
by nauful 7y ago
Do you mean following the hash chain to the end of the window? If you want an exhaustive LZ matchfinder, a trie, binary tree such as LZMA's bt4 or suffix array are more efficient algorithms, especially with window sizes larger than 32K