Sciweavers

1487 search results - page 38 / 298
» The Computational Complexity of Link Building
Sort
View
ISSAC
2007
Springer
83views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Parallel computation of the rank of large sparse matrices from algebraic K-theory
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 ...
Jean-Guillaume Dumas, Philippe Elbaz-Vincent, Pasc...
MASCOTS
2004
13 years 10 months ago
A Framework for Resource Allocation in Grid Computing
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...
Daniel A. Menascé, Emiliano Casalicchio
TPDS
2008
124views more  TPDS 2008»
13 years 8 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
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...
János Tapolcai, Pin-Han Ho, Anwar Haque
BMCBI
2007
153views more  BMCBI 2007»
13 years 8 months ago
Estimating genealogies from linked marker data: a Bayesian approach
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...
Dario Gasbarra, Matti Pirinen, Mikko J. Sillanp&au...
SIGCOMM
2006
ACM
14 years 2 months ago
Building an AS-topology model that captures route diversity
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...
Wolfgang Mühlbauer, Anja Feldmann, Olaf Maenn...