Result 1 to 20 of 1048 total
Selecting feature subset for high dimensional data via the propositional FOIL rules. (English)
Pattern Recognition 46, No. 1, 199-214 (2013).
1
Maximum directed cuts in graphs with degree constraints. (English)
Graphs Comb. 28, No. 4, 563-574 (2012).
2
On a graph partition result of Kűhn and Osthus. (English)
Ars Comb. 103, 491-495 (2012).
3
Edge choosablity and total choosability of toroidal graphs without intersecting triangles. (English)
Ars Comb. 103, 109-118 (2012).
4
Distributed formal concept analysis algorithms based on an iterative MapReduce framework. (English)
Domenach, Florent (ed.) et al., Formal concept analysis. 10th international conference, ICFCA 2012, Leuven, Belgium, May 7‒10, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29891-2/pbk). Lecture Notes in Computer Science 7278. Lecture Notes in Artificial Intelligence, 292-308 (2012).
5
The secyrity of sarg04 protocol in plug and play QKD system with an untrusted source. (English)
Quantum Inf. Comput. 12, No. 7-8, 630-647 (2012).
6
A note on maximal properties of some subsemigroups of finite order-preserving transformation semigroups. (English)
Commun. Algebra 40, No. 3, 1116-1121 (2012).
7
Injective choosability of planar graphs of girth five and six. (English)
Discrete Math. 312, No. 6, 1260-1265 (2012).
8
Upper bounds on minimum balanced bipartitions. (English)
Discrete Math. 312, No. 6, 1077-1083 (2012).
9
Object-based multilevel image enhancement method. (Chinese)
J. Comput. Appl. 31, No. 6, 1556-1559 (2011).
10
On the structure of real-valued one-dimensional cellular automata. (English)
Int. J. Bifurcation Chaos Appl. Sci. Eng. 21, No. 5, 1265-1279 (2011).
11
On signed cycle (vertex) domination in graphs. (Chinese)
J. Henan Inst. Educ., Nat. Sci. 20, No. 4, 1-3 (2011).
12
Reverse minus edge total domination in graphs. (Chinese)
J. Henan Univ. Sci. Technol., Nat. Sci. 32, No. 4, 71-73,78 (2011).
13
The signed edge total $k$-domination numbers of graphs. (Chinese)
J. Jiangxi Norm. Univ., Nat. Sci. Ed. 35, No. 3, 316-318 (2011).
14
On the gracefulness of graph $P^3_{6k+33}\cup P^3_n$. (Chinese)
J. Anhui Univ., Nat. Sci. 35, No. 5, 14-17 (2011).
15
Importance of tie strengths in the prisoner’s dilemma game on social networks. (English)
Phys. Lett., A 375, No. 24, 2269-2273 (2011).
16
Gracefulness of graph $P^3_n\cup \widetilde{P}_4$. (Chinese)
J. Henan Norm. Univ., Nat. Sci. 39, No. 2, 27-29 (2011).
17
On the rank of order-preserving and compressing singular transformation semigroups. (Chinese)
J. Shandong Univ., Nat. Sci. 46, No. 6, 4-7 (2011).
18
A unified approach to type synthesis of both rigid and flexure parallel mechanisms. (English)
Sci. China, Technol. Sci. 54, No. 5, 1206-1219 (2011).
19
Contribution-based call stack abstraction for call string based pointer analysis. (English)
Inf. Softw. Technol. 53, No. 6, 654-665 (2011).
20
Result 1 to 20 of 1048 total
Start
Contact
Print
General Help
