Sciweavers

2043 search results - page 259 / 409
» The Limits of Querying Ontologies
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 9 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
PODS
2006
ACM
138views Database» more  PODS 2006»
14 years 9 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
INFOCOM
2003
IEEE
14 years 2 months ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan
WWW
2011
ACM
13 years 4 months ago
Learning to re-rank: query-dependent image re-ranking using click data
Our objective is to improve the performance of keyword based image search engines by re-ranking their baseline results. To this end, we address three limitations of existing searc...
Vidit Jain, Manik Varma
ASIAN
2005
Springer
178views Algorithms» more  ASIAN 2005»
14 years 2 months ago
An Approach for Service Discovery Based on Semantic Peer-to-Peer
The service discovery is a key step during Peer-to-Peer (P2P) converging with Web Service. In this paper, a semantic-P2P based approach is presented for web service discovery. To e...
Hao Wu, Hai Jin, Yunfa Li, Hanhan Chen