1376 search results - page 163 / 276 » Searching Trees: An Essay |
203
click to vote
SIGIR
2011
ACM
14 years 9 months ago
2011
ACM
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
170
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
175
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
167
click to vote
IJCAI
2003
15 years 7 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
166
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...