2423 search results - page 158 / 485 » AnswerArt - Contextualized Question Answering |
165
click to vote
TOC
2010
15 years 1 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
152
click to vote
LAWEB
2005
IEEE
16 years 1 days ago
2005
IEEE
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
146
click to vote
ASIAN
2005
Springer
16 years 21 hour ago
2005
Springer
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
192
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categoriza...
182
click to vote
HCI
2009
15 years 4 months ago
2009
It becomes more difficult to find valuable contents in the Web 2.0 environment since lots of inexperienced users provide many unorganized contents. In the previous researches, peop...