Sciweavers

10493 search results - page 1695 / 2099
» Dynamic Word Problems
Sort
View
MP
2011
14 years 10 months ago
An interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
Lifeng Chen, Donald Goldfarb
SIAMJO
2011
14 years 10 months ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...
IACR
2011
113views more  IACR 2011»
14 years 7 months ago
Implementing 4-Dimensional GLV Method on GLS Elliptic Curves with j-Invariant 0
Abstract. The Gallant-Lambert-Vanstone (GLV) method is a very efcient technique for accelerating point multiplication on elliptic curves with eciently computable endomorphisms. G...
Zhi Hu, Patrick Longa, Maozhi Xu
WSDM
2012
ACM
309views Data Mining» more  WSDM 2012»
14 years 3 months ago
Mining contrastive opinions on political texts using cross-perspective topic model
This paper presents a novel opinion mining research problem, which is called Contrastive Opinion Modeling (COM). Given any query topic and a set of text collections from multiple ...
Yi Fang, Luo Si, Naveen Somasundaram, Zhengtao Yu
ICFP
2008
ACM
16 years 7 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
« Prev « First page 1695 / 2099 Last » Next »