Sciweavers

2957 search results - page 236 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
RSA
2010
104views more  RSA 2010»
15 years 5 months ago
An approximation algorithm for counting contingency tables
Abstract. We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column ...
Alexander I. Barvinok, Zur Luria, Alex Samorodnits...
IJDMB
2010
128views more  IJDMB 2010»
15 years 3 months ago
Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal latt
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
Alessandro Dal Palù, Agostino Dovier, Enric...
TSP
2010
15 years 1 months ago
A recursive method for the approximation of LTI systems using subband processing
Using the subband technique, an LTI system can be implemented by the composition of an analysis filterbank, followed by a transfer matrix (subband model) and a synthesis filterbank...
Damián Marelli, Minyue Fu
ICRA
2008
IEEE
197views Robotics» more  ICRA 2008»
16 years 1 months ago
Approximate optimal control of the compass gait on rough terrain
Abstract— In this paper, we explore the capabilities of actuated models of the compass gait walker on rough terrain. We solve for the optimal high-level feedback policy to negoti...
Katie Byl, Russ Tedrake
NIPS
2007
15 years 8 months ago
Bayesian binning beats approximate alternatives: estimating peri-stimulus time histograms
The peristimulus time histogram (PSTH) and its more continuous cousin, the spike density function (SDF) are staples in the analytic toolkit of neurophysiologists. The former is us...
Dominik Endres, Mike W. Oram, Johannes E. Schindel...