Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Computer Sciences
Benchmarking Bottom-Up And Top-Down Strategies To Sparql-To-Sql Query Translation, Andrii Kashliev
Benchmarking Bottom-Up And Top-Down Strategies To Sparql-To-Sql Query Translation, Andrii Kashliev
Theses and Dissertations - UTB/UTPA
Many researchers have proposed using conventional relational databases to store and query large Semantic Web datasets. The most complex component of this approach is SPARQL-to-SQL query translation. Existing algorithms perform this translation using either bottom-up or top-down strategy and result in semantically equivalent but syntactically different relational queries. Do relational query optimizers always produce identical query execution plans for semantically equivalent bottom-up and top-down queries? Which of the two strategies yields faster SQL queries? To address these questions, this work studies bottom-up and top-down translations of SPARQL queries with nested optional graph patterns. This work presents: (1) A basic graph …
Intractability Of Integration And Derivative For Multivariate Polynomial And Trigonometric Function, Liang Ding
Intractability Of Integration And Derivative For Multivariate Polynomial And Trigonometric Function, Liang Ding
Theses and Dissertations - UTB/UTPA
We study the hardness of some basic linear operators which involve high dimension integration or derivative. For a multivariate polynomial ��(��1, ⋯ , ����) which has format ∏ ∑ ��1, we show that there is no any factor polynomial time approximation for the integration of ��(��1, ⋯ , ����) in the unit cube [0,1] �� unless P = NP. In addition to polynomials, we extend the discussion to nonlinear function. For a trigonometric function ��(��1, ⋯ , ����) of format ∏ ∑ �������� ∗ , we show that it is #P-hard to compute derivative ����(��) (��1,⋯,����) ����1⋯������ at the origin …
Narrative Analysis And Computational Model To Predict Interestingness Of Narratives, Laxman Thapa
Narrative Analysis And Computational Model To Predict Interestingness Of Narratives, Laxman Thapa
Theses and Dissertations - UTB/UTPA
In this research, I present results demonstrating the classification of the specially generated narratives by a machine agent by listening to human subject describing the same sets of the events. These classifications are based on human ratings of interestingness for many different recountings of the same stories. The classification is performed on various features selected after analyzing the different possible feature that affect on the interestingness of narratives. The features were extracted from the surface text as well as from annotations of how each narration relates to the content of the known story. I present the annotation process and resulting …
Partition A 3-Colorable Graph Into A Small Bipartite Subgraph And A Large Independent Set, Qing Wang
Partition A 3-Colorable Graph Into A Small Bipartite Subgraph And A Large Independent Set, Qing Wang
Theses and Dissertations - UTB/UTPA
Exact algorithms have made a little progress for the 3-coloring problem: improved from to since 1976. The best exact algorithm for the 3-coloring problem is by Beigel and Eppstein, and its analysis is very complicated. We study the parameterized 3-coloring problem: partitioning a 3-colorable graph into a bipartite subgraph and an independent set. Taking the size of the bipartite subgraph as the parameter k, we propose the first parameter algorithm of complexity . Our algorithm can solve the 3-coloring problem faster than the best exact algorithm for graphs with k ≤ 0.527n where n is the graph size. Our study …