Sciweavers

64 search results - page 13 / 13
» Computations with quasiseparable polynomials and matrices
Sort
View
FCT
2007
Springer
13 years 9 months ago
On the Complexity of Kings
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tan...
IOR
2008
104views more  IOR 2008»
13 years 7 months ago
Arrival Rate Approximation by Nonnegative Cubic Splines
Estimating the arrival rate function of a non-homogeneous Poisson process based on observed arrival data is a problem naturally arising in many applications. Cubic spline function...
Farid Alizadeh, Jonathan Eckstein, Nilay Noyan, G&...
BMCBI
2007
107views more  BMCBI 2007»
13 years 7 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
TIT
2008
83views more  TIT 2008»
13 years 7 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck