Result 1 to 20 of 3493 total
Oblivious access control policies for cloud based data sharing systems. (English)
Computing 94, No. 12, 915-938 (2012).
1
Genetic-fuzzy mining with taxonomy. (English)
Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 20, Suppl. 2, 187-205 (2012).
2
An efficient method for learning nonlinear ranking SVM functions. (English)
Inf. Sci. 209, 37-48 (2012).
3
MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server. (English)
Comput. Oper. Res. 39, No. 11, 2457-2468 (2012).
4
Implementation of mutual localization of multi-robot using particle filter. (English)
Huang, De-Shuang (ed.) et al., Intelligent computing technology. 8th international conference, ICIC 2012, Huangshan, China, July 25‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31587-9/pbk). Lecture Notes in Computer Science 7389, 87-94 (2012).
5
Design of a high precision logarithmic converter in a binary floating point divider. (English)
Concurrency Comput. Pract. Exp. 24, No. 4, 342-353 (2012).
6
Collaborative similarity measure for intra graph clustering. (English)
Yu, Hwanjo (ed.) et al., Database systems for advanced applications. 17th international conference, DASFAA 2012, international workshops: Flashdb, ITEMS, SNSM, SIM, DQDI, Busan, South Korea, April 15‒19, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29022-0/pbk). Lecture Notes in Computer Science 7240, 204-215 (2012).
7
PyCUDA and PyOpenCL: a scripting-based approach to GPU run-time code generation. (English)
Parallel Comput. 38, No. 3, 157-174 (2012).
8
High-payload image hiding with quality recovery using tri-way pixel-value differencing. (English)
Inf. Sci. 191, 214-225 (2012).
9
Construction of extremal self-dual codes over $\Bbb F_2+u\Bbb F_2$ with an automorphism of odd order. (English)
Finite Fields Appl. 18, No. 5, 971-992 (2012).
10
Cryptanalysis and improvement of a biometrics-based multi-server authentication with key agreement scheme. (English)
Murgante, Beniamino (ed.) et al., Computational science and its applications ‒ ICCSA 2012. 12th international conference, Salvador de Bahia, Brazil, June 18‒21, 2012. Proceedings, Part III. Berlin: Springer (ISBN 978-3-642-31136-9/pbk). Lecture Notes in Computer Science 7335, 391-406 (2012).
11
A new hybrid method for 3D object recovery from 2D drawings and its validation against the cubic corner method and the optimisation-based method. (English)
Comput.-Aided Des. 44, No. 11, 1090-1102 (2012).
12
A parallel metaheuristic framework based on harmony search for scheduling in distributed computing systems. (English)
Int. J. Found. Comput. Sci. 23, No. 2, 445-464 (2012).
13
Enhanced secure anonymous authentication scheme for roaming service in global mobility networks. (English)
Math. Comput. Modelling 55, No. 1-2, 214-222 (2012).
14
Differential fault analysis on block cipher SEED. (English)
Math. Comput. Modelling 55, No. 1-2, 26-34 (2012).
15
Non-negative matrix factorization based noise reduction for noise robust automatic speech recognition. (English)
Theis, Fabian (ed.) et al., Latent variable analysis and signal separation. 10th international conference, LVA/ICA 2012, Tel Aviv, Israel, March 12‒15, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28550-9/pbk). Lecture Notes in Computer Science 7191, 338-346 (2012).
16
Convergence study of minimizing the nonconvex total delay using the lane-based optimization method for signal-controlled junctions. (English)
Discrete Dyn. Nat. Soc. 2012, Article ID 858731, 14 p. (2012).
17
Profit-driven scheduling for cloud services with data access awareness. (English)
J. Parallel Distrib. Comput. 72, No. 4, 591-602 (2012).
18
Nonlinear systems design by a novel fuzzy neural system via hybridization of electromagnetism-like mechanism and particle swarm optimisation algorithms. (English)
Inf. Sci. 186, No. 1, 59-72 (2012).
19
Efficient object identification and localization for image retrieval using query-by-region. (English)
Comput. Math. Appl. 63, No. 2, 511-517 (2012).
20
Result 1 to 20 of 3493 total
Start
Contact
Print
General Help
