427 search results - page 33 / 86 » Efficient search in file-sharing networks |
CONNECTION
2007
13 years 7 months ago
2007
In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory...
SEMWEB
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Much of the research on automated Web Service Composition (WSC) relates it to an AI planning task, where the composition is primarily done offline prior to execution. Rec...
BMCBI
2008
13 years 7 months ago
2008
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...