5084 search results - page 931 / 1017 » Proving Possibility Properties |
130
click to vote
WG
1998
Springer
15 years 8 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
170
click to vote
COMPGEOM
1992
ACM
15 years 8 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
140
Voted
STOC
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
148
click to vote
ACSAC
2009
IEEE
15 years 8 months ago
2009
IEEE
Emerging distributed computing architectures, such as grid and cloud computing, depend on the high integrity execution of each system in the computation. While integrity measuremen...
147
Voted
ELPUB
2007
ACM
15 years 8 months ago
2007
ACM
The following paper presents a case study of the way that the research done by the LAIRAH project may be applied in the case of a real digital resource for humanities scholarship....