Sciweavers

1068 search results - page 94 / 214
» Factorization as a Rank 1 Problem
Sort
View
JC
2008
128views more  JC 2008»
15 years 3 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
JMLR
2008
230views more  JMLR 2008»
15 years 3 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
FOCS
2004
IEEE
15 years 7 months ago
Edge-Disjoint Paths in Planar Graphs
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
APPROX
2004
Springer
100views Algorithms» more  APPROX 2004»
15 years 8 months ago
Estimating the Distance to a Monotone Function
In standard property testing, the task is to distinguish between objects that have a property P and those that are ε-far from P, for some ε > 0. In this setting, it is perfec...
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, D...
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
14 years 3 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett