3630 search results - page 178 / 726 » Fast Marching Methods |
162
click to vote
CIVR
2003
Springer
15 years 11 months ago
2003
Springer
Feature selection for video retrieval applications is impractical with existing techniques, because of their high time complexity and their failure on the relatively sparse trainin...
185
click to vote
ICCAD
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents an efficient method for optimizing power/ground (P/G) networks by widening wires and adding decoupling capacitors (decaps). It proposes a structured skeleton t...
154
click to vote
VISUALIZATION
1998
IEEE
15 years 10 months ago
1998
IEEE
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification ...
175
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
163
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...