Sciweavers

297 search results - page 50 / 60
» On the Decidability of Consistent Query Answering
Sort
View
160
Voted
ICTL
1994
15 years 3 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto
COOPIS
2004
IEEE
15 years 3 months ago
Learning Classifiers from Semantically Heterogeneous Data
Semantically heterogeneous and distributed data sources are quite common in several application domains such as bioinformatics and security informatics. In such a setting, each dat...
Doina Caragea, Jyotishman Pathak, Vasant Honavar
DEXAW
2007
IEEE
142views Database» more  DEXAW 2007»
15 years 1 months ago
Synopsis Data Structures for XML Databases: Models, Issues, and Research Perspectives
Due to the lack of efficient native XML database management systems, XML data manipulation and query evaluation may be resource-consuming, and represent a bottleneck for several ...
Angela Bonifati, Alfredo Cuzzocrea
SPAA
2009
ACM
16 years 6 days ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
108
Voted
ICALP
2004
Springer
15 years 5 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee