1477 search results - page 144 / 296 » Complexity of (iterated) dominance |
192
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
164
click to vote
VLSID
2006
IEEE
16 years 6 months ago
2006
IEEE
With increasing design complexity, as well as continued scaling of supplies, the design and analysis of power/ground distribution networks poses a difficult problem in modern IC d...
204
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
166
click to vote
WAW
2009
Springer
16 years 1 months ago
2009
Springer
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
198
click to vote
CRV
2008
IEEE
16 years 28 days ago
2008
IEEE
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...