2254 search results - page 114 / 451 » Computing the minimal covering set |
141
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
201
click to vote
CCCG
2007
15 years 8 months ago
2007
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
172
click to vote
CCE
2004
15 years 6 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
166
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose a sinogram restoration method which consists of a patch-wise non-linear processing, based on a sparsity prior in terms of a learned dictionary. An off-line learning pro...
180
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...