Sciweavers

2272 search results - page 83 / 455
» Capture Complexity by Partition
Sort
View
DAGM
2010
Springer
14 years 10 months ago
Complex Motion Models for Simple Optical Flow Estimation
The selection of an optical flow method is mostly a choice from among accuracy, efficiency and ease of implementation. While variational approaches tend to be more accurate than lo...
Claudia Nieuwenhuis, Daniel Kondermann, Christoph ...
CORR
2008
Springer
208views Education» more  CORR 2008»
14 years 10 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
APAL
2004
105views more  APAL 2004»
14 years 9 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
SJ
2011
14 years 4 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...
BIRTHDAY
2010
Springer
14 years 11 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe