Sciweavers

2608 search results - page 270 / 522
» Inferring Answers to Queries
Sort
View
INEX
2004
Springer
16 years 16 hour ago
A Voting Method for XML Retrieval
This paper describes the retrieval approach proposed by the SIG/EVI group of the IRIT research centre in INEX’2004 evaluation. The approach uses a voting method coupled with some...
Gilles Hubert
INEX
2004
Springer
16 years 16 hour ago
Using a Relevance Propagation Method for Adhoc and Heterogeneous Tracks at INEX 2004
This paper describes the evaluation of the XFIRM system in INEX 2004 framework. The XFIRM system uses a relevance propagation method to answer queries composed of content condition...
Karen Sauvagnat, Mohand Boughanem
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 10 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
FOCS
2010
IEEE
15 years 4 months ago
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...
Moritz Hardt, Guy N. Rothblum
FOCS
1998
IEEE
15 years 11 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello