5316 search results - page 348 / 1064 » Which Search Problems Are Random |
202
click to vote
CIKM
2008
Springer
15 years 9 months ago
2008
Springer
In automated text categorization, given a small number of labeled documents, it is very challenging, if not impossible, to build a reliable classifier that is able to achieve high...
185
Voted
JAIR
2006
15 years 7 months ago
2006
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
207
click to vote
SIGIR
2008
ACM
15 years 7 months ago
2008
ACM
The primary business model behind Web search is based on textual advertising, where contextually relevant ads are displayed alongside search results. We address the problem of sel...
204
Voted
JMLR
2010
15 years 2 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
241
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...