Sciweavers

3740 search results - page 470 / 748
» A Fast Skeletonization Method
Sort
View
118
Voted
DCC
2005
IEEE
16 years 2 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
SP
2009
IEEE
15 years 9 months ago
Exploiting Unix File-System Races via Algorithmic Complexity Attacks
We defeat two proposed Unix file-system race condition defense mechanisms. First, we attack the probabilistic defense mechanism of Tsafrir, et al., published at USENIX FAST 2008[...
Xiang Cai, Yuwei Gui, Rob Johnson
143
Voted
ISDA
2009
IEEE
15 years 9 months ago
A Fuzzy Wavelet Neural Network Model for System Identification
In this paper, a fuzzy wavelet neural network model is proposed for system identification problems. The proposed model is obtained from the traditional Takagi-Sugeno-Kang (TSK) fu...
Sevcan Yilmaz, Yusuf Oysal
127
Voted
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 9 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
115
Voted
ISSAC
2009
Springer
169views Mathematics» more  ISSAC 2009»
15 years 9 months ago
Computations modulo regular chains
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
Xin Li, Marc Moreno Maza, Wei Pan