Sciweavers

928 search results - page 90 / 186
» The degree structure of Weihrauch-reducibility
Sort
View
CORR
2006
Springer
131views Education» more  CORR 2006»
15 years 6 months ago
Analysis of LDGM and compound codes for lossy compression and binning
Abstract-- Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on ...
Emin Martinian, Martin J. Wainwright
NETWORKS
2008
15 years 6 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
FAST
2007
15 years 7 months ago
A Five-Year Study of File-System Metadata
For five years, we collected annual snapshots of filesystem metadata from over 60,000 Windows PC file systems in a large corporation. In this paper, we use these snapshots to s...
Nitin Agrawal, William J. Bolosky, John R. Douceur...
JMLR
2006
118views more  JMLR 2006»
15 years 6 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
CCE
2004
15 years 6 months ago
A strategy for MINLP synthesis of flexible and operable processes
This paper presents a sequential two-stage strategy for the stochastic synthesis of chemical processes in which flexibility and ability to adjust manipulated variables are taken i...
Zorka Novak Pintaric, Zdravko Kravanja