4843 search results - page 453 / 969 » The Shortcut Problem - Complexity and Approximation |
160
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
128
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
175
click to vote
ECCC
2010
15 years 5 months ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
144
click to vote
AMC
2006
15 years 5 months ago
2006
Derived from the Markov character only, the master equation of chemical reactions is an accurate stochastic description of quite general systems in chemistry. Exact solutions of t...
133
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...