1012 search results - page 78 / 203 » Segment intersection searching problems in general settings |
158
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
This paper presents a general framework for building classifiers that deal with short and sparse text & Web segments by making the most of hidden topics discovered from larges...
152
click to vote
EVOW
2008
Springer
15 years 7 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
137
click to vote
KBS
2007
15 years 5 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
167
click to vote
IPPS
2009
IEEE
16 years 3 days ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
147
click to vote
SIGIR
2008
ACM
15 years 5 months ago
2008
ACM
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...