Is a SPARQL query computationally powerful enough to test (s,t)-connectivity? I don’t think so, but I don’t understand the mysterious PropertyPath, and even without it, I’m not sure. Tell me on Stack Overflow.
-
Posts
- aco ai4hm algorithms baby animals Bayesian books conference contest costs data viz dataviz disease modeling dismod diversity diversity club free/open source funding gaussian processes gbd global health health inequality health metrics health records idv IDV4GH ihme infoviz ipython iraq journal club machine learning malaria matching algorithms matchings mazes MCMC media microsimulation mortality mpld3 my research Mysteries networks networkx optimization orms pandas probability public health pymc pymc3 python random effects reading list reproducible research reproductive health research jobs seminar sklearn software carpentry spanning trees sparql statistics stats survey system dynamics talks TCS teaching Theory Blogs travel tutorial va verbal autopsy vital registration
Theory Blogs
- 0xDE (David Eppstein)
- Computational Complexity (Lance Fortnow/Bill Gasarch)
- In Theory (Luca Trevisan)
- Luis von Blog (Luis von Ahn)
- Machine Learning (Theory) (John Langford & others)
- Micael Trick’s Operations Research Blog
- My Slice of Pizza (Muthu)
- Punk Rock Operations Research (Laura McLay)
- Shtetl-Optimized (Scott Aaronson)
- Structure and Strangeness (Aaron Clauset)
some rights reserved
This material is released under the Creative Commons Noncommercial Attribution Share-Alike 3.0 LicensePages
Archives
Meta
Healthy Algorithms · A blog about algorithms, combinatorics, and optimization applications in global health informatics.
Pingback: k-NN in SPARQL? | Healthy Algorithms