themonteray
Re:Researchers achieve ‘absurdly fast’ algorithm for network flow
on Wednesday June 08, 2022 @10:26PM (#31676971)
o(1) is "little O" notation, where for a function y = o(f), y(x) / f(x) --> 0 as x --> infinity. In other words, y goes to 0 faster than f. In this context, m^(1 + o(1)) means roughly that you converge to linear time for large m.
Re:Show HN: SymForce – Fast symbolic computation, code generation, and...
on Tuesday May 24, 2022 @05:37PM (#31497805)
Super cool! How does this compare with Casadi? I didn't see it mentioned in the related AD frameworks in the paper, but I think that targets a similar niche? Thanks for releasing the library!
Re:How does Brown University know where you are?
on Saturday December 05, 2020 @10:53PM (#25320874)
I am also an alum. (Some of) Brown's tracking information isn't even particularly restricted. I have seen firsthand that live location information based on your device being connected to the network (I assume based on tracking MAC address as discussed in the article) gives room-level granularity, and can be accessed by students who work for the IT service center.