Sciweavers

824 search results - page 61 / 165
» Weighted Low-Rank Approximations
Sort
View
UAI
1998
14 years 11 months ago
Large Deviation Methods for Approximate Probabilistic Inference
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
Michael J. Kearns, Lawrence K. Saul
MP
2006
84views more  MP 2006»
14 years 9 months ago
Optimal 3-terminal cuts and linear programming
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
SIAMNUM
2010
87views more  SIAMNUM 2010»
14 years 4 months ago
Flux Recovery and A Posteriori Error Estimators: Conforming Elements for Scalar Elliptic Equations
In this paper, we first study two flux recovery procedures for the conforming finite element approximation to general second-order elliptic partial differential equations. One is a...
Zhiqiang Cai, Shun Zhang
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 7 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
15 years 10 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy