Artem Kaznatcheev

@kaznatcheev

Use cancer to know biology. View learning & evolution + philosophy of sci through the algorithmic lens. Blogger at TheEGG. DPhil at Oxford CS. On the job market

Oxford, England
Vrijeme pridruživanja: kolovoz 2016.

Medijski sadržaj

  1. 3. velj

    Nice way to highlight & disorient 'benign' parts surveillance capitalism: walked around Berlin w/ wagon full of 99 smartphones running Google Maps thus creating 'traffic jams' & changing green streets to red: I feel might enjoy this

  2. 23. sij

    Nice video by on physicality of some of our behavioural/cognitive aids. Focused on chalk & blackboards of mathematicians: Some solid points (although I do also know some folks that have a purely hipster/signalling relationship to blackboards).

    Prikaži ovu nit
  3. 5. sij

    Nice to compare Oxford in 1605 (map by John Speed, 1551-1629) to Oxford today (map by /u/MisterEggs with ). It is interesting to see how much of the old city is recognizable today. Fun to spot your college, too.

    , , i još njih 3
  4. 4. sij

    Today is going to be a podcast-full day: Listening to on my way to a taping of with queued up for the return.

  5. 6. pro 2019.

    But before digging into the logic, Rob shares some of his experimental tests of the assumptions of adaptive therapy, especially cost of resistance. He claims his system has cost of resistance, but claim is based only on monoculture experiments? Dangerous to ignore coculture...

    Prikaži ovu nit
  6. 6. pro 2019.

    Happy to see presenting at tumour club in on his ongoing work on understand the logical structure needed for a model to allow adaptive therapy to be useful.

    Prikaži ovu nit
  7. 5. pro 2019.

    I'm excited to see this solid work by Alexandru Strimbu of & up on ArXiv: He built useful tool for simulating evolutionary dynamics on VCSP-represented fitness landscapes & started simulation study of hard fitness landscapes

    , , i još njih 7
    Prikaži ovu nit
  8. 4. pro 2019.

    And on the commute home: cobwebs.

    Prikaži ovu nit
  9. 4. pro 2019.

    Happiness is that feeling when you're running low on concentration energy and your partner reminds you of the snacks they hid in your desk for times like this.

  10. 4. pro 2019.

    That famous England fog over the river Thames on the commute to work today.

    Prikaži ovu nit
  11. 22. stu 2019.

    Looks like is taking scientific hackathons to next level with '72 hours of science': get diverse group of academics together with goal of producing a paper in 72 hrs: Sounds like a great way to learn your colleagues's strengths & interests!

    Prikaži ovu nit
  12. 22. stu 2019.

    So although winding landscape is ‘simple’, it's not easy to represent compactly. We open paper by proving any gene-interaction network (GIN) that represents winding landscape must be dense (lots of epistasis!) & unbounded treewidth -- a complex GIN, probably unlikely in biology?

    Prikaži ovu nit
  13. 21. stu 2019.

    Today at , Matthew Jenssen is tells us about what makes Grauber dynamics of hard-core model either fast or slow mixing. With some demos carried around to the audience due to technical glitches. Useful things to know if you think a lot about Markov chains or counting

  14. 21. stu 2019.

    How 'simple' can hard families of landscapes be? In a fresh paper joint w/ Dave Cohen, Martin Cooper & Mark Wallace, we show (in bio terms) that even landscapes with bounded-treewidth gene-interaction networks can be hard for fittest-mutant SSWM dynamics:

    Prikaži ovu nit
  15. 13. stu 2019.

    A voice assistant controlling a smart home can feel secure since only users inside house should be able to issue voice commands. But a team from UEC Tokyo & show that you can vibrate microphone in assistants via laser through a window: /cc

    Prikaži ovu nit
  16. 13. stu 2019.

    Looks like the start of yet another editing/writing session.

  17. 7. stu 2019.
    Odgovor korisnicima i sljedećem broju korisnika:

    I even wore the same Abel prize shirt today to celebrate. Keeping it Swedish themed?

  18. 7. stu 2019.

    So for his second attempt, Reidl decided to go all the way to releasing code on GitHub. He introduced us to the problem of counting motifs and even showed a live demo of his code for counting motifs in bounded expansion graphs. Some good takeaways from this beautiful talk.

    Prikaži ovu nit
  19. 7. stu 2019.

    Reidl then introduced his theoretical notion of bounded expansion graphs and his first (failed) attempt to connect to practice by showing that various kinds of random graphs have bounded expansion...

    Prikaži ovu nit
  20. 7. stu 2019.

    Today at , Felix Reidl is telling us about the road from theory to practice for structurally sparse graph algorithms in CS and why it can feel like a maze. We need to challenge our reputation of just coming into a practical field, saying 'this is NP hard' & leaving

    Prikaži ovu nit

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·