248 search results - page 46 / 50 » The Relative Complexity of NP Search Problems |
FLAIRS
2004
13 years 9 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
13 years 7 months 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...
SEMCO
2009
IEEE
14 years 2 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 ...
SIGIR
2009
ACM
14 years 2 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...
ISMIS
2009
Springer
14 years 2 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...