17366 search results - page 185 / 3474 » New Revision Algorithms |
161
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
123
click to vote
ICIP
2002
IEEE
16 years 6 months ago
2002
IEEE
The Stage By Stage Approaching (SSA) entropy minimization approach to synthetic aperture radar (SAR) autofocus is a modern and innovative technique, which has not been compared wi...
142
click to vote
CSR
2009
Springer
15 years 11 months ago
2009
Springer
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...
123
click to vote
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
— This paper introduces the concept of kl-feasible cuts, by controlling both the number k of inputs and the number l of outputs in a circuit cut. To provide scalability, the conc...
134
click to vote
CAIP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Interaction increases flexibility of segmentation but it leads to undesirable behaviour of an algorithm if knowledge being requested is inappropriate. In region growing, ...