Sciweavers

12148 search results - page 303 / 2430
» Generalized Bundle Methods
Sort
View
MOC
1998
106views more  MOC 1998»
15 years 7 months ago
Bounds for eigenvalues and condition numbers in the p-version of the finite element method
In this paper, we present a theory for bounding the minimum eigenvalues, maximum eigenvalues, and condition numbers of stiffness matrices arising from the p-version of finite ele...
Ning Hu, Xian-Zhong Guo, I. Norman Katz
JMLR
2010
115views more  JMLR 2010»
15 years 5 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
CHI
2010
ACM
15 years 5 months ago
A comparative evaluation on tree visualization methods for hierarchical structures with large fan-outs
Hierarchical structures with large fan-outs are hard to browse and understand. In the conventional node-link tree visualization, the screen quickly becomes overcrowded as users op...
Hyunjoo Song, Bo Hyoung Kim, Bongshin Lee, Jinwook...
ICDM
2010
IEEE
167views Data Mining» more  ICDM 2010»
15 years 5 months ago
Averaged Stochastic Gradient Descent with Feedback: An Accurate, Robust, and Fast Training Method
On large datasets, the popular training approach has been stochastic gradient descent (SGD). This paper proposes a modification of SGD, called averaged SGD with feedback (ASF), tha...
Xu Sun, Hisashi Kashima, Takuya Matsuzaki, Naonori...
GD
2009
Springer
15 years 5 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...