Sciweavers

401 search results - page 48 / 81
» Group-theoretic Algorithms for Matrix Multiplication
Sort
View
JSC
2008
126views more  JSC 2008»
13 years 7 months ago
Computing singular points of plane rational curves
We compute the singular points of a plane rational curve, parametrically given, using the implicitization matrix derived from the -basis of the curve. It is shown that singularity...
Falai Chen, Wenping Wang, Yang Liu
IEEECIT
2007
IEEE
14 years 2 months ago
Overview of LDPC Codes
In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approach...
Zongjie Tu, Shiyong Zhang
STOC
2007
ACM
128views Algorithms» more  STOC 2007»
14 years 8 months ago
Iteratively constructing preconditioners via the conjugate gradient method
We consider the problem of solving a symmetric, positive definite system of linear equations. The most well-known and widely-used method for solving such systems is the preconditi...
John Dunagan, Nicholas J. A. Harvey
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 5 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
ICCV
2011
IEEE
12 years 8 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan