Sciweavers

2570 search results - page 117 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
DCC
2007
IEEE
15 years 9 months ago
Efficient pairing computation on supersingular Abelian varieties
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
Paulo S. L. M. Barreto, Steven D. Galbraith, Colm ...
AAAI
2007
15 years 15 days ago
A Mathematical Programming Formulation for Sparse Collaborative Computer Aided Diagnosis
A mathematical programming formulation is proposed to eliminate irrelevant and redundant features for collaborative computer aided diagnosis which requires to detect multiple clin...
Jinbo Bi, Tao Xiong
153
Voted
PDPTA
2008
14 years 11 months ago
A Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems
- Load balancing is a crucial issue in parallel and distributed systems to ensure fast processing and optimum utilization of computing resources. Load balancing strategies try to e...
Bibhudatta Sahoo, Sudipta Mohapatra, Sanjay Kumar ...
ICMCS
2008
IEEE
138views Multimedia» more  ICMCS 2008»
15 years 4 months ago
Using H.264 coded block patterns for fast inter-mode selection
The support of variable block-sizes, though significantly improves the compression efficiency, imposes a big computational challenge on an H.264 encoder. In this paper, we present...
Bo-Yuan Chen, Shih-Hsuan Yang
JMIV
2008
268views more  JMIV 2008»
14 years 10 months ago
A Fast Marching Method for the Area Based Affine Distance
In this paper we consider the problem of computing the area-based affine distance for a convex domain in the plane. Since this affine distance satisfies a non-homogeneous Monge-Amp...
Moacyr A. H. B. da Silva, Ralph Teixeira, Sin&eacu...