1402 search results - page 154 / 281 » Sparse-Memory Graph Search |
130
Voted
MM
2010
ACM
15 years 2 months ago
2010
ACM
In Web 2.0, users have generated and shared massive amounts of resources in various media formats, such as news, blogs, audios, photos and videos. The abundance and diversity of t...
139
click to vote
AIPS
2004
15 years 3 months ago
2004
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
123
click to vote
EJC
2006
15 years 2 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
111
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
116
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
Abstract. In this paper we present static and dynamic studies of duplicate and near-duplicate documents in the Web. The static and dynamic studies involve the analysis of similar c...