5316 search results - page 101 / 1064 » Which Search Problems Are Random |
148
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
122
click to vote
MATES
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Searching for information in large rather unstructured realworld data sets is a di cult task, because the user expects immediate responses as well as high-quality search ...
120
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
119
Voted
COMSWARE
2008
IEEE
15 years 9 months ago
2008
IEEE
—In this paper, we have presented a novel algorithm for searching Peer-to-Peer (P2P) networks which forms power law topology. It is completely decentralized in nature and hence i...
148
click to vote
ACL
2009
15 years 1 months ago
2009
We present a novel approach to parse web search queries for the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which genera...