2008 search results - page 180 / 402 » Computing with Equations |
163
click to vote
MFCS
2001
Springer
15 years 7 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
84
Voted
DAC
1999
ACM
15 years 6 months ago
1999
ACM
We study the variation of the crosstalk in a net and its neighbors when one of its trunks is perturbed, showing that the trunk’s perturbation range can be efficiently divided i...
130
click to vote
ICCV
1999
IEEE
15 years 6 months ago
1999
IEEE
An approach to extract watersheds and watercourses, as well as their corresponding valleys and hills, from images with subpixel precision is proposed. The critical points of the t...
114
click to vote
SCALESPACE
1999
Springer
15 years 6 months ago
1999
Springer
We develop on estimation method, for the derivative field of an image based on Bayesian approach which is formulated in a geometric way. The Maximum probability configuration of ...
DAC
1994
ACM
15 years 6 months ago
1994
ACM
We describe ASTRX/OBLX, a synthesis system that can size high-performance analog circuit topologies to meet usersupplied linear performance specifications without designer-supplied...