Sciweavers

3740 search results - page 198 / 748
» A Fast Skeletonization Method
Sort
View
CIVR
2003
Springer
107views Image Analysis» more  CIVR 2003»
14 years 4 months ago
Fast Video Retrieval under Sparse Training Data
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...
Yan Liu, John R. Kender
VISUALIZATION
1998
IEEE
14 years 3 months ago
Fast and memory efficient polygonal simplification
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 ...
Peter Lindstrom, Greg Turk
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
14 years 2 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- 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...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
ECML
2006
Springer
14 years 2 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
FPL
2008
Springer
143views Hardware» more  FPL 2008»
14 years 9 days ago
Fast toggle rate computation for FPGA circuits
This paper presents a fast and scalable method of computing signal toggle rate in FPGA-based circuits. Our technique is a vectorless estimation technique, which can be used in a C...
Tomasz S. Czajkowski, Stephen Dean Brown