412 search results - page 71 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
LCPC
1998
Springer
15 years 1 months ago
1998
Springer
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle...
83
Voted
COMCOM
2002
14 years 9 months ago
2002
Abstract-We propose a new webserver architecture optimized for delivery of large, popular files. Delivery of such files currently pose a scalability problem for conventional conten...
BMCBI
2006
14 years 9 months ago
2006
Background: Modeling of cis-elements or regulatory motifs in promoter (upstream) regions of genes is a challenging computational problem. In this work, set of regulatory motifs si...
116
click to vote
SMA
2009
ACM
15 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...