Sciweavers

3630 search results - page 250 / 726
» Fast Marching Methods
Sort
View
TRUSTBUS
2005
Springer
16 years 5 hour ago
A Mediated Proxy Signature Scheme with Fast Revocation for Electronic Transactions
Abstract. Proxy signature schemes allow an original signer to delegate his signing rights to a proxy signer. Most proxy signature schemes have succeeded for proxy delegations and t...
Seung-Hyun Seo, Kyung-Ah Shim, Sang-Ho Lee
ICIAR
2004
Springer
15 years 12 months ago
A Fast Probabilistic Bidirectional Texture Function Model
The bidirectional texture function (BTF) describes rough texture appearance variations due to varying illumination and viewing conditions. Such a function consists of thousands of ...
Michal Haindl, Jirí Filip
PAKDD
2004
ACM
137views Data Mining» more  PAKDD 2004»
15 years 12 months ago
Fast and Light Boosting for Adaptive Mining of Data Streams
Supporting continuous mining queries on data streams requires algorithms that (i) are fast, (ii) make light demands on memory resources, and (iii) are easily to adapt to concept dr...
Fang Chu, Carlo Zaniolo
CODES
2003
IEEE
15 years 11 months ago
A fast parallel reed-solomon decoder on a reconfigurable architecture
This paper presents a software implementation of a very fast parallel Reed-Solomon decoder on the second generation of MorphoSys reconfigurable computation platform, which is targ...
Arezou Koohi, Nader Bagherzadeh, Chengzi Pan
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 11 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz