Sciweavers

491 search results - page 26 / 99
» A Fast KNN Algorithm Based on Simulated Annealing
Sort
View
WSCG
2003
143views more  WSCG 2003»
13 years 9 months ago
Fast Algorithm for Stochastic Tree Computation
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which â...
Meng-Zhen Kang, Philippe de Reffye, Jean Fran&cced...
PRL
2006
96views more  PRL 2006»
13 years 7 months ago
Fast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh
ICCV
2003
IEEE
14 years 9 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
RTSS
2008
IEEE
14 years 2 months ago
Fast Sensor Placement Algorithms for Fusion-Based Target Detection
Mission-critical target detection imposes stringent performance requirements for wireless sensor networks, such as high detection probabilities and low false alarm rates. Data fus...
Zhaohui Yuan, Rui Tan, Guoliang Xing, Chenyang Lu,...
ISCAS
1994
IEEE
117views Hardware» more  ISCAS 1994»
14 years 19 hour ago
Design of a Fast Sequential Decoding Algorithm Based on Dynamic Searching Strategy
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
Wen-Wei Yang, Li-Fu Jeng, Chen-Yi Lee