s_tim

4 ms·

1. 1.▲
   Cloudflare billing incident since 26 days(cloudflarestatus.com)

   3 points by s_tim 2y ago|0 comments
2. 2.▲
   by s_tim 2y ago

   How does this compare to Enzyme ( https://enzyme.mit.edu/ )?
3. 3.▲
   Figure Status Update – OpenAI Speech-to-Speech Reasoning [video](youtube.com)

   7 points by s_tim 3y ago|0 comments
4. 4.▲
   by s_tim 3y ago

   But you would need to spend the $15 on every request whereas the RAG approach would be most likely significantly cheaper per request.
5. 5.▲
   Gumroad raised $5M as a SAFE without ever needing to convert to shares(twitter.com)

   8 points by s_tim 4y ago|1 comments
6. 6.▲
   3264 conics tangent to five conics(juliahomotopycontinuation.org)

   79 points by s_tim 8y ago|4 comments
7. 7.▲
   It's embarassing, really(fastml.com)

   1 points by s_tim 9y ago|0 comments
8. 8.▲
   Apple's A10X Is TSMC 10nm FF(anandtech.com)

   5 points by s_tim 9y ago|0 comments
9. 9.▲
   by s_tim 10y ago

   You build from the different tuples in your list just one graph. Then it's just a simple DFS/BFS with one random start node. Which gives you your first component. Then you can get the second if you start at a node which is not in
10. 10.▲
    by s_tim 10y ago

    You could model the problem as a graph (each integer represents a vertex and two consecutive integers an edge, e.g. (1, 2, 3) is a graph with nodes 1,2,3 and edges between 1 and 2 and 2 and 3). Then your problem is just to find all connecte
11. 11.▲
    Inside Facebook(international.sueddeutsche.de)

    4 points by s_tim 10y ago|0 comments