Sciweavers

1487 search results - page 37 / 298
» The Computational Complexity of Link Building
Sort
View
RECOMB
2009
Springer
14 years 3 months ago
Reconstructing Histories of Complex Gene Clusters on a Phylogeny
Abstract. Clusters of genes that have evolved by repeated segmental duplication present difficult challenges throughout genomic analysis, from sequence assembly to functional analy...
Tomás Vinar, Brona Brejová, Giltae S...
SEMCO
2008
IEEE
14 years 2 months ago
TcruziKB: Enabling Complex Queries for Genomic Data Exploration
We developed a novel analytical environment to aid in the examination of the extensive amount of interconnected data available for genome projects. Our focus is to enable ity and ...
Pablo N. Mendes, Bobby McKnight, Amit P. Sheth, Je...
WSC
2008
13 years 10 months ago
High performance spreadsheet simulation on a desktop grid
We present a proof-of-concept prototype for high performance spreadsheet simulation called S3. Our goal is to provide a user-friendly, yet computationally powerful simulation envi...
Juta Pichitlamken, Supasit Kajkamhaeng, Putchong U...
ICNP
2007
IEEE
14 years 2 months ago
Inferring the Origin of Routing Changes using Link Weights
— The global Internet routing infrastructure is a large and complex distributed system where routing changes occur constantly. Our objective in this paper is to develop a simple ...
Mohit Lad, Ricardo V. Oliveira, Daniel Massey, Lix...
CN
2007
141views more  CN 2007»
13 years 8 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou