4843 search results - page 347 / 969 » The Shortcut Problem - Complexity and Approximation |
124
click to vote
CSE
2008
IEEE
15 years 4 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
146
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
166
click to vote
SIAMSC
2010
15 years 2 months ago
2010
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...
136
click to vote
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(