Sciweavers

952 search results - page 117 / 191
» Computational complexity of stochastic programming problems
Sort
View
ECCV
2008
Springer
16 years 4 months ago
Finding Actions Using Shape Flows
Abstract. We propose a novel method for action detection based on a new action descriptor called a shape flow that represents both the shape and movement of an object in a holistic...
Hao Jiang, David R. Martin
DCC
2005
IEEE
16 years 2 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
ICASSP
2009
IEEE
15 years 9 months ago
Distributed peer-to-peer beamforming for multiuser relay networks
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...
BIRTHDAY
2010
Springer
15 years 4 months ago
Finding Reductions Automatically
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
Michael Crouch, Neil Immerman, J. Eliot B. Moss
ICPR
2004
IEEE
16 years 4 months ago
Alignment of Multiple Non-Overlapping Axially Symmetric 3D Datasets
Uknown to us, an axially-symmetric surface is broken into disjoint pieces along a set of break-curves, i.e., the curves along which the surface locally breaks into two pieces. A s...
Andrew R. Willis, David B. Cooper