2577 search results - page 176 / 516 » Multimedia Question Answering |
172
click to vote
JGT
2011
15 years 1 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...
206
click to vote
INTENV
2010
15 years 29 days 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 ...
160
click to vote
TOC
2010
15 years 25 days 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 ...
172
Voted
PCM
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, attention is paid to the automatic generation of XML-based descriptions containing information about the high-level structure of binary multimedia resources. These s...
145
Voted
LAWEB
2005
IEEE
15 years 11 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...