Sciweavers

157 search results - page 17 / 32
» Constrained Optimalities in Query Personalization
Sort
View
SIGIR
2011
ACM
12 years 10 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
AAAI
2008
13 years 10 months ago
Minimal Contraction of Preference Relations
Changing preferences is very common in real life. The expressive power of the operations of preference change introduced so far in the literature is limited to adding new informat...
Denis Mindolin, Jan Chomicki
DLOG
2006
13 years 9 months ago
Extending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually pro...
Vladimir Kolovski, Bijan Parsia, Evren Sirin
VLDB
2001
ACM
119views Database» more  VLDB 2001»
14 years 7 months ago
PicoDBMS: Scaling down database techniques for the smartcard
Smartcards are the most secure portable computing device today. They have been used successfully in applications involving money, proprietary and personal data (such as banking, h...
Philippe Pucheral, Luc Bouganim, Patrick Valduriez...
CCS
2008
ACM
13 years 9 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...