Sciweavers

2323 search results - page 368 / 465
» Power optimization for connectivity problems
Sort
View
143
Voted
AIPS
2006
15 years 4 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
128
Voted
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 3 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
164
Voted
SIAMJO
2010
246views more  SIAMJO 2010»
15 years 1 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
ICPR
2010
IEEE
15 years 10 months ago
A Unified Probabilistic Approach to Feature Matching and Object Segmentation
This paper deals with feature matching and segmentation of common objects in a pair of images, simultaneously. For the feature matching problem, the matching likelihoods of all fea...
Tae Hoon Kim (Seoul National University), Kyoung M...
GLOBECOM
2009
IEEE
15 years 10 months ago
REPARE: Regenerator Placement and Routing Establishment in Translucent Networks
—Most research works in routing and design of optical networks assume that the optical medium can carry data signals without any bit error. However, physical impairments of the o...
Weiyi Zhang, Jian Tang, Kendall E. Nygard, Chongga...