170 search results - page 3 / 34 » Relevance Cuts: Localizing the Search |
SIGIR
2010
ACM
13 years 11 months ago
2010
ACM
We build a probabilistic model to identify implicit local intent queries, and leverage user’s physical location to improve Web search results for these queries. Evaluation on co...
ICTAI
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
DATESO
2007
13 years 9 months ago
2007
Authors are looking within their research grant new original web local search algorithm respecting specifics of Czech national environment. We would like to initiate further debate...