TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Graph: Faster Abstractions for Structured Computation

101 pointsby olenhadabout 12 years ago

3 comments

taliesinbabout 12 years ago
At one point, I did a similar thing for a computer vision system I was working on.<p>That was quite naturally a filter graph: every component was time-dependent, caching and logging was important (rewind to find this blob 5 minutes ago), and parallelism was crucial because the system had to deal with synchronizing multiple IP cameras.<p>Amazingly, it was possible to do this in an entirely safe way in C++, with templates.<p>I wish I could put the code up on github, but unfortunately the company got taken apart and sold, so the code is in limbo.
msandfordabout 12 years ago
This is great work. Stuff I've been thinking about for a number of years but never actually doing. I wish there were something like this for Python. I know it's not pure, but it's my drug of choice. Anyhow, kudos.
评论 #5640334 未加载
评论 #5643530 未加载
评论 #5642157 未加载
评论 #5640393 未加载
w01feabout 12 years ago
Coauthor of Graph here, I'm happy to answer any questions.
评论 #5641862 未加载
评论 #5642322 未加载
评论 #5640164 未加载