Sciweavers

1656 search results - page 221 / 332
» Labeling Schemes with Queries
Sort
View
IJCAI
2003
13 years 9 months ago
A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases
In previous work, Levesque proposed an extension to classical databases that would allow for a certain form of incomplete first-order knowledge. Since this extension was suffici...
Yongmei Liu, Hector J. Levesque
TREC
2003
13 years 9 months ago
Passage Scoring for Question Answering via Bayesian Inference on Lexical Relations
Many researchers have used lexical networks and ontologies to mitigate synonymy and polysemy problems in Question Answering (QA), systems coupled with taggers, query classifiers,...
Deepa Paranjpe, Ganesh Ramakrishnan, Sumana Sriniv...
PVLDB
2010
122views more  PVLDB 2010»
13 years 2 months ago
ZINC: Efficient Indexing for Skyline Computation
We present a new indexing method named ZINC (for Z-order Indexing with Nested Code) that supports efficient skyline computation for data with both totally and partially ordered at...
Bin Liu, Chee-Yong Chan
PKC
2012
Springer
212views Cryptology» more  PKC 2012»
11 years 10 months ago
Security of Blind Signatures Revisited
We revisit the definition of unforgeability of blind signatures as proposed by Pointcheval and Stern (Journal of Cryptology 2000). Surprisingly, we show that this established de...
Dominique Schröder, Dominique Unruh
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
14 years 9 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis