Sciweavers

23 search results - page 2 / 5
» Banded structure in binary matrices
Sort
View
CAV
1999
Springer
104views Hardware» more  CAV 1999»
13 years 9 months ago
On the Representation of Probabilities over Structured Domains
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
Marius Bozga, Oded Maler
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 4 months ago
Embedded Rank Distance Codes for ISI channels
Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time...
Sanket Dusad, Suhas N. Diggavi, A. Robert Calderba...
TIT
2010
174views Education» more  TIT 2010»
12 years 11 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...
BICOB
2010
Springer
13 years 2 months ago
Multiple Kernel Learning for Fold Recognition
Fold recognition is a key problem in computational biology that involves classifying protein sharing structural similarities into classes commonly known as "folds". Rece...
Huzefa Rangwala
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 2 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala