Sciweavers

2835 search results - page 195 / 567
» Automatic Question Answering
Sort
View
DM
2011
184views Education» more  DM 2011»
14 years 11 months ago
Graphs of arbitrary excessive class
We show that there exists a family of r-regular graphs of arbitrarily large excessive index for each integer r greater than 3. Furthermore, we answer a question in [1] showing tha...
Giuseppe Mazzuoccolo, M. Young
120
Voted
JAT
2011
64views more  JAT 2011»
14 years 11 months ago
Two remarks on remotality
We prove that there exists a weakly closed and bounded subset E of c0 which is not remotal from 0, and such that co (E) is remotal from 0. This answers a question of M. Mart´ın ...
Michal Kraus
JGT
2011
76views more  JGT 2011»
14 years 11 months ago
Intersections of graphs
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...
Béla Bollobás, Alex D. Scott
INTENV
2010
14 years 11 months ago
A Survey in Consciousness in Robots and Future of Reception Robots
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 ...
Hossein Farid Ghassem Nia
TOC
2010
123views Management» more  TOC 2010»
14 years 11 months ago
Rounds vs. Queries Tradeoff in Noisy Computation
: 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 ...
Navin Goyal, Michael Saks