Sciweavers

1369 search results - page 179 / 274
» Lattice computations for random numbers
Sort
View
RECOMB
2012
Springer
13 years 10 days ago
A Model for Biased Fractionation after Whole Genome Duplication
Background: Paralog reduction, the loss of duplicate genes after whole genome duplication (WGD) is a pervasive process. Whether this loss proceeds gene by gene or through deletion...
David Sankoff, Chunfang Zheng, Baoyong Wang
VLSID
2004
IEEE
292views VLSI» more  VLSID 2004»
15 years 10 months ago
NoCGEN: A Template Based Reuse Methodology for Networks on Chip Architecture
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...
Jeremy Chan, Sri Parameswaran
PERCOM
2007
ACM
15 years 9 months ago
Dynamic Carrier-Assisted Routing in Mobile Networks
We propose to use node mobility to enhance routing capability in a mobile network. A dual-control planes model is presented, which includes the traditional S(stationary)-plane for ...
Jie Wu
WSC
2000
14 years 11 months ago
Quasi-Monte Carlo methods in cash flow testing simulations
What actuaries call cash flow testing is a large-scale simulation pitting a company's current policy obligation against future earnings based on interest rates. While life co...
Michael G. Hilgers
ITA
2006
163views Communications» more  ITA 2006»
14 years 10 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...