Sciweavers

775 search results - page 86 / 155
» Cone-restricted subspace methods
Sort
View
DATE
2003
IEEE
95views Hardware» more  DATE 2003»
15 years 3 months ago
A New Simulation Technique for Periodic Small-Signal Analysis
A new numerical technique for periodic small signal analysis based on harmonic balance method is proposed. Special-purpose numerical procedures based on Krylov subspace methods ar...
Mark M. Gourary, Sergey G. Rusakov, Sergey L. Ulya...
IACR
2011
91views more  IACR 2011»
13 years 9 months ago
Improved Generalized Birthday Attack
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
Paul Kirchner
AAAI
2012
13 years 9 days ago
Convex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
Mingkui Tan, Ivor W. Tsang, Li Wang, Xinming Zhang
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
15 years 10 months ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
SIAMSC
2011
151views more  SIAMSC 2011»
14 years 4 months ago
Inexact Newton Methods with Restricted Additive Schwarz Based Nonlinear Elimination for Problems with High Local Nonlinearity
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
Xiao-Chuan Cai, Xuefeng Li