Result 1 to 20 of 1397 total
Labeling outerplanar graphs with maximum degree three. (English)
Discrete Appl. Math. 161, No. 1-2, 200-211 (2013).
1
Probabilistic classifiers with a generalized Gaussian scale mixture prior. (English)
Pattern Recognition 46, No. 1, 332-345 (2013).
2
Binding number and minimum degree for $(a,b,k)$-critical graphs. (English)
Util. Math. 88, 309-315 (2012).
3
Normalized Born approximation-based two-stage reconstruction algorithm for quantitative fluorescence molecular tomography. (English)
J. Electr. Comput. Eng. 2012, Article ID 838967, 9 p. (2012).
4
Independence number and minimum degree for fractional ID-$k$-factor-critical graphs. (English)
Aequationes Math. 84, No. 1-2, 71-76 (2012).
5
Robust ISOMAP based on neighbor ranking metric. (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, 221-229 (2012).
6
SVM regularizer models on RKHS vs. on $R ^{m }$. (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, 103-111 (2012).
7
A minimum degree condition for fractional ID-$[a,b]$-factor-critical graphs. (English)
Bull. Aust. Math. Soc. 86, No. 2, 177-183 (2012).
8
Special issue: exploring the frontiers of computing science and technology: efficiently utilizing multicore and many-core processors. (English)
Concurrency Comput. Pract. Exp. 24, No. 2, 109-110 (2012).
9
Accelerating climate and weather simulations through hybrid computing. (English)
Concurrency Comput. Pract. Exp. 24, No. 1, 54-61 (2012).
10
Guest editor’s introduction: special section on challenges and solutions in multicore and many-core computing. (English)
Concurrency Comput. Pract. Exp. 24, No. 1, 1-2 (2012).
11
Kernelization of matrix updates, when and how? (English)
Bshouty, Nader H. (ed.) et al., Algorithmic learning theory. 23rd international conference, ALT 2012, Lyon, France, October 29‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-34105-2/pbk). Lecture Notes in Computer Science 7568. Lecture Notes in Artificial Intelligence, 350-364 (2012).
12
Detecting potential collusive cliques in futures markets based on trading behaviors from real data. (English)
Neurocomputing 92, 44-53 (2012).
13
The conditional fault diagnosability of $(n, k)$-star graphs. (English)
Appl. Math. Comput. 218, No. 19, 9742-9749 (2012).
14
Per-layer transmit and receive filters design for Tomlinson-Harashima precoding in multiuser MIMO systems. (English)
Sci. China, Inf. Sci. 55, No. 4, 839-849 (2012).
15
A binding number condition for graphs to be $(a, b, k)$-critical graphs. (English)
Arab J. Math. Sci. 18, No. 2, 87-96 (2012).
16
Binding number and minimum degree for the existence of fractional $k$-factors with prescribed properties. (English)
Util. Math. 87, 123-129 (2012).
17
Gossiping and routing in second-kind Frobenius graphs. (English)
Eur. J. Comb. 33, No. 6, 1001-1014 (2012).
18
A new neighborhood condition for graphs to be fractional $(k,m)$-deleted graphs. (English)
Appl. Math. Lett. 25, No. 3, 509-513 (2012).
19
Heterochromatic tree partition problem in complete tripartite graphs. (English)
Discrete Math. 312, No. 4, 789-802 (2012).
20
Result 1 to 20 of 1397 total
Start
Contact
Print
General Help
