3946 search results - page 739 / 790 » The computational complexity of choice sets |
153
click to vote
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Due to the exponential growth of information on the Web, Recommender Systems have been developed to generate suggestions to help users overcome information overload and sift thr...
190
click to vote
SEMCO
2009
IEEE
16 years 1 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 ...
199
click to vote
CIVR
2009
Springer
16 years 26 days ago
2009
Springer
Many of the successful multimedia retrieval systems focus on developing efficient and effective video retrieval solutions with the help of appropriate index structures. In these ...
171
click to vote
CONCUR
2009
Springer
16 years 26 days ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
167
click to vote
GECCO
2009
Springer
16 years 26 days ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...