Sciweavers

13603 search results - page 169 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
HCI
2009
15 years 4 months ago
A Computational Implementation of a Human Attention Guiding Mechanism in MIDAS v5
In complex human-machine systems, the human operator is often required to intervene to detect and solve problems. Given this increased reliance on the human in these critical human...
Brian F. Gore, Becky L. Hooey, Christopher D. Wick...
SPAA
2010
ACM
15 years 6 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
EM
2010
155views Management» more  EM 2010»
15 years 6 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...
ICDT
2012
ACM
293views Database» more  ICDT 2012»
13 years 9 months ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
15 years 11 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen