Sciweavers

377 search results - page 43 / 76
» Discrete stochastic optimization using linear interpolation
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
13 years 11 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
TIT
1998
81views more  TIT 1998»
13 years 7 months ago
Fast Iterative Coding Techniques for Feedback Channels
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
James M. Ooi, Gregory W. Wornell
SC
1995
ACM
13 years 11 months ago
Distributing a Chemical Process Optimization Application Over a Gigabit Network
We evaluate the impact of a gigabit network on the implementation of a distributed chemical process optimization application. The optimization problem is formulated as a stochasti...
Robert L. Clay, Peter Steenkiste
STACS
2007
Springer
14 years 1 months ago
Pure Stationary Optimal Strategies in Markov Decision Processes
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. Performances of an MDP are evaluated by a payoff function. The controller of ...
Hugo Gimbert
ICIP
2006
IEEE
14 years 9 months ago
Two-Stage Optimal Component Analysis
Linear techniques are widely used to reduce the dimension of image representation spaces in applications such as image indexing and object recognition. Optimal Component Analysis ...
Yiming Wu, Xiuwen Liu, Washington Mio, Kyle A. Gal...