2043 search results - page 286 / 409 » The Limits of Querying Ontologies |
BNCOD
2003
14 years 19 hour ago
2003
Evaluating a query can involve manipulation of large volumes of temporary data. When the volume of data becomes too great, activities such as joins and sorting must use disk, and ...
ECIR
2003
Springer
14 years 14 hour ago
2003
Springer
As more and more structured documents, such as SGML or XML documents become available on the Web, there is a growing demand to develop effective structured document retrieval which...
CCGRID
2010
IEEE
13 years 11 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
CN
2010
13 years 10 months ago
2010
Abstract. In this paper, we propose a completely distributed topology generation mechanism named HPC5 for Gnutella network. A Gnutella topology will be efficient and scalable if it...
ECCC
2010
13 years 10 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...