3630 search results - page 451 / 726 » Fast Marching Methods |
130
click to vote
DCC
2005
IEEE
16 years 4 months ago
2005
IEEE
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...
117
Voted
SP
2009
IEEE
15 years 11 months ago
2009
IEEE
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[...
156
click to vote
ISDA
2009
IEEE
15 years 11 months ago
2009
IEEE
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...
149
click to vote
EUROCAST
2009
Springer
15 years 11 months ago
2009
Springer
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...
133
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...