Sciweavers

16404 search results - page 2770 / 3281
» A set coverage problem
Sort
View
IEE
2008
115views more  IEE 2008»
15 years 7 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller
BMCBI
2006
129views more  BMCBI 2006»
15 years 7 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
COR
2006
94views more  COR 2006»
15 years 7 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 7 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai
CORR
2006
Springer
77views Education» more  CORR 2006»
15 years 7 months ago
Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...
Wei Dai, Youjian Liu, Brian Rider
« Prev « First page 2770 / 3281 Last » Next »