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
Tags
aco algorithms baby animals Bayesian conference disclosure limitation dismod EM free/open source funding gaussian processes gbd health inequality health metrics health records ihme infoviz ipython journal club machine learning malaria matching algorithms matchings MCMC media my research Mysteries networks networkx optimization orms privacy probability public health pymc python reproductive health research jobs science policy spanning trees sparql statistics stats TCS tutorialTheory 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