248 search results - page 46 / 50 » The Relative Complexity of NP Search Problems |
108
click to vote
FLAIRS
2004
15 years 1 months ago
2004
Open source intelligence analysts routinely use the web as a source of information related to their specific taskings. Effective information gathering on the web, despite the prog...
EOR
2008
15 years 13 days ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
115
Voted
SEMCO
2009
IEEE
15 years 7 months ago
2009
IEEE
—This is a paper about a new resource, namely an English paraphrase dictionary extracted from the FrameNet lexicon and its example data base. I. THE LEXPAR PARAPHRASE DICTIONARY ...
118
Voted
SIGIR
2009
ACM
15 years 6 months ago
2009
ACM
The selection of indexing terms for representing documents is a key decision that limits how effective subsequent retrieval can be. Often stemming algorithms are used to normaliz...
101
click to vote
ISMIS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...