Sciweavers

8413 search results - page 13 / 1683
» Ordering Problem Subgoals
Sort
View
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
11 years 10 months ago
Constructing high order elements through subspace polynomials
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
Qi Cheng, Shuhong Gao, Daqing Wan
ICASSP
2011
IEEE
12 years 11 months ago
Stochastic optimization based on the Laplace transform order with applications to precoder designs
Stochastic optimization arising from precoding in a multi-antenna fading channel with channel mean feedback to maximize data rates is important but challenging. The use of relayin...
Minhua Ding, Keith Q. T. Zhang
PAMI
2012
11 years 10 months ago
Detachable Object Detection: Segmentation and Depth Ordering from Short-Baseline Video
—We describe an approach for segmenting a moving image into regions that correspond to surfaces in the scene that are partially surrounded by the medium. It integrates both appea...
Alper Ayvaci, Stefano Soatto
SIAMIS
2010
283views more  SIAMIS 2010»
13 years 2 months ago
A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...
Ernie Esser, Xiaoqun Zhang, Tony F. Chan
ECAI
2010
Springer
13 years 9 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert