2440 search results - page 165 / 488 » Data-Intensive Question Answering |
JGT
2011
13 years 5 months ago
2011
Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide som...
INTENV
2010
13 years 5 months ago
2010
This paper presents a story about consciousness and future of reception robots. A prototype version of reception robot is developed at university of Essex for university open days ...
TOC
2010
13 years 4 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 ...
LAWEB
2005
IEEE
14 years 3 months 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...
ASIAN
2005
Springer
14 years 3 months 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...