1487 search results - page 7 / 298 » The Computational Complexity of Link Building |
HOTOS
1997
IEEE
13 years 11 months ago
1997
IEEE
ty of accurately re-creating a mobile networkingAbstract environment in vitro argues for live experiments. On the In this paper we put forth the view that trace other hand, the dif...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
Hyperlinks are an essential feature of the World Wide Web, highly responsible for its success. XLink improves on HTML's linking capabilities in several ways. In particular, l...
FSTTCS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
DIAGRAMS
2006
Springer
13 years 11 months ago
2006
Springer
Illustrating a dynamic process with an arrow-containing diagram is a widespread convention in people's daily communications. In order to build a basis for capturing the struct...