Sciweavers

491 search results - page 38 / 99
» A Fast KNN Algorithm Based on Simulated Annealing
Sort
View
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 2 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
ICIP
2001
IEEE
14 years 9 months ago
Fast algorithms for DCT-domain video transcoding
Video transcoding is an efficient way for. rate adaptation and format conversion in various networked video applications. Many transcoder architectures have been proposed to achie...
Chia-Wen Lin, Yuh-Ruey Lee
CSC
2009
13 years 9 months ago
Fast Monte Carlo Algorithms on Re-Wired Small-World Spin Models
Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
Kenneth A. Hawick
ICIP
2002
IEEE
14 years 9 months ago
A fast back-projection algorithm for bistatic SAR imaging
Using a far-field model, bistatic synthetic aperture radar (SAR) acquires Fourier data on a rather unusual, non-Cartesian grid in the Fourier domain. Previous image formation algo...
Yu Ding, David C. Munson Jr.
TSP
2010
13 years 2 months ago
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji