1477 search results - page 15 / 296 » Complexity of (iterated) dominance |
141
click to vote
ISPD
1999
ACM
15 years 10 months ago
1999
ACM
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
149
click to vote
VISSOFT
2005
IEEE
15 years 11 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
159
click to vote
SSPR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
172
click to vote
CVPR
2010
IEEE
16 years 8 days ago
2010
IEEE
We present a method for real-time 3D object detection
that does not require a time consuming training stage, and
can handle untextured objects. At its core, is a novel tem-
plat...
167
click to vote
ICRA
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper, we propose a 2D visual motion estimation method which can be exploited to achieve a dynamic positioning (eg. by gaze control) with respect to a sea-bottom area of i...