\(P\)-top-\(k\) queries in a probabilistic framework from information extraction models (Q660968): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.camwa.2011.06.064
+Normal rank
@@ Property / OpenAlex ID @@
+W2091346112
@@ Property / OpenAlex ID: W2091346112 / rank @@
+Normal rank
@@ Property / cites work @@
+Managing and mining uncertain data
@@ Property / cites work: Managing and mining uncertain data / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximate reasoning
@@ Property / cites work: On the hardness of approximate reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+Incomplete Information in Relational Databases
@@ Property / cites work: Incomplete Information in Relational Databases / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal aggregation algorithms for middleware.
@@ Property / cites work: Optimal aggregation algorithms for middleware. / rank @@
+Normal rank
@@ Property / cites work @@
+Answering queries using views: A survey
@@ Property / cites work: Answering queries using views: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+The problem of incomplete information in relational databases
+Normal rank
@@ Property / cites work @@
+Learning to parse natural language with maximum entropy models
+Normal rank