Sciweavers

1243 search results - page 34 / 249
» On the locality of bounded growth
Sort
View
SJ
2011
13 years 2 months ago
Analyzing the Resilience of Complex Supply Network Topologies Against Random and Targeted Disruptions
—In this paper, we study the resilience of supply networks against disruptions and provide insights to supply chain managers on how to construct a resilient supply network from t...
Kang Zhao, Akhil Kumar, Terry P. Harrison, John Ye...
DISOPT
2011
210views Education» more  DISOPT 2011»
13 years 2 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
ICML
2008
IEEE
14 years 8 months ago
Estimating local optimums in EM algorithm over Gaussian mixture model
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is no...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
CVPR
2009
IEEE
15 years 2 months ago
Pose Estimation for Category Specific Multiview Object Localization
We propose an approach to overcome the two main challenges of 3D multiview object detection and localization: The variation of object features due to changes in the viewpoint an...
Mustafa Özuysal, Pascal Fua, Vincent Lepetit
STACS
1994
Springer
13 years 11 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman