Sciweavers

4553 search results - page 210 / 911
» Distributed Ranked Search
Sort
View
119
Voted
EUROPAR
2004
Springer
15 years 8 months ago
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
Edson Norberto Cáceres, Frank K. H. A. Dehn...
137
Voted
ADL
1998
Springer
178views Digital Library» more  ADL 1998»
15 years 6 months ago
Distributed Digital Library Architecture Incorporating Different Index Styles
The New Zealand Digital Library offers several collections of information over the World Wide Web. Although fulltext indexing is the primary access mechanism, musical collections ...
Rodger J. McNab, Ian H. Witten, Stefan J. Boddie
143
Voted
JSAC
2007
107views more  JSAC 2007»
15 years 2 months ago
DESENT: decentralized and distributed semantic overlay generation in P2P networks
Abstract— The current approach in web searching, i.e., centralized search engines, rises issues that question their future applicability: 1) coverage and scalability, 2) freshnes...
Christos Doulkeridis, Kjetil Nørvåg, ...
143
Voted
ICML
1994
IEEE
15 years 6 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
ICEC
1994
82views more  ICEC 1994»
15 years 4 months ago
Improving Search by Incorporating Evolution Principles in Parallel Tabu Search
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
Ivan De Falco, Renato Del Balio, Ernesto Tarantino...