-
-
Recent Posts
Categories
- ALOE
- Announcements
- AutoSPARQL
- best practices in the Web of Data
- BigDataEurope
- BorderFlow
- Call for Paper
- Call for Students
- Cofundos
- Colloquium
- conTEXT
- Data Quality
- Dataset Release
- dbpedia
- DIESEL
- DL-Learner
- DSSN
- Erfurt
- Events
- FOX
- GEISER
- HOBBIT
- invited talk
- Kickoff
- Language Identification
- LATC
- LDAP 2 SPARQL
- LEDS
- LESS
- LIMES
- Linked Geo Data
- LinkingLOD
- LOD2
- LUCID
- major tool release
- Mobile Social Semantic Web
- NLP2RDF
- OntoWiki
- OntoWiki Mobile
- ORE
- paper presentation
- Papers
- PHD progress report
- PHD thesis defense practise
- PhD topic
- Powl
- Press Release
- project kick-off
- Projects
- RDFaCE
- Research
- SAKE
- SANSA
- SCMS
- SlideWiki
- SLIPO
- SMLBench
- Software Releases
- SoftWiki
- SPARQL2NL
- Triplify
- tutorial
- Uncategorized
- workshop
- workshop or tutorial
- xOperator
- Xturtle
Meta
Author Archives: Andre Valdestilhas
More Complete Resultset Retrieval from Large Heterogeneous RDF Sources
Over recent years, the Web of Data has grown significantly. Various interfaces such as LOD Stats, LOD Laundromat and SPARQL endpoints provide access to hundreds of thousands of RDF datasets, representing billions of facts. These datasets are available in different … Continue reading
Posted in paper presentation, Papers
Tagged k-cap2019, large datasets, wimuq
Comments Off on More Complete Resultset Retrieval from Large Heterogeneous RDF Sources
AKSW Colloquium, 12 October, 3pm, A High Performance Approach to String Distance using Most Frequent K Characters
Andre Valdestilhas will present the current state of his work “A High Performance Approach to String Distance using Most Frequent K Characters”. Abstract The idea is to reduce the computation in Link Discovery using and improving a String Distance Function called Most … Continue reading
Posted in Colloquium
Comments Off on AKSW Colloquium, 12 October, 3pm, A High Performance Approach to String Distance using Most Frequent K Characters