Sciweavers

5105 search results - page 321 / 1021
» Approximate Structural Consistency
Sort
View
IJFCS
2006
70views more  IJFCS 2006»
15 years 6 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
JSAC
2008
70views more  JSAC 2008»
15 years 6 months ago
LMMSE turbo equalization based on factor graphs
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
Qinghua Guo, Li Ping
CANDC
2000
ACM
15 years 6 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...
ICASSP
2011
IEEE
15 years 4 months ago
Non-flat clustering whith alpha-divergences
The scope of the well-known k-means algorithm has been broadly extended with some recent results: first, the k- means++ initialization method gives some approximation guarantees...
Olivier Schwander, Frank Nielsen
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 4 months ago
CUR from a Sparse Optimization Viewpoint
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
Jacob Bien, Ya Xu, Michael W. Mahoney