2738 search results - page 319 / 548 » The Frobenius Problem and Its Generalizations |
228
click to vote
JMLR
2010
15 years 29 days ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
188
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
156
click to vote
LCTRTS
2007
Springer
16 years 9 days ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
216
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
166
click to vote
FC
1998
Springer
15 years 10 months ago
1998
Springer
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...