169 search results - page 26 / 34 » Decentralized Search with Random Costs |
TPDS
2010
13 years 5 months ago
2010
—Utilizing the skewed popularity distribution in P2P systems, common in Gnutella and KazaA like P2P applications, we propose an optimal resource (replica or link) placement strat...
CIKM
2010
Springer
13 years 5 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
WWW
2003
ACM
14 years 7 months ago
2003
ACM
The presence of replicas or near-replicas of documents is very common on the Web. Documents may be replicated completely or partially for different reasons (versions, mirrors, etc...
CP
2000
Springer
13 years 11 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
AICCSA
2008
IEEE
13 years 8 months ago
2008
IEEE
Time Series are ubiquitous, hence, similarity search is one of the biggest challenges in the area of mining time series data. This is due to the vast data size, number of sequence...