1487 search results - page 38 / 298 » The Computational Complexity of Link Building |
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
This paper deals with the computation of the rank and some integer Smith forms of a series of sparse matrices arising in algebraic K-theory. The number of non zero entries in the ...
127
click to vote
MASCOTS
2004
15 years 5 months ago
2004
Grid computing is the future computing paradigm for enterprise applications. An enterprise application running on a grid is composed of a set of SLA-constrained sub-tasks demandin...
150
click to vote
TPDS
2008
15 years 3 months ago
2008
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
159
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Answers to several fundamental questions in statistical genetics would ideally require knowledge of the ancestral pedigree and of the gene flow therein. A few examples...
134
click to vote
SIGCOMM
2006
ACM
15 years 9 months ago
2006
ACM
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...