Result 1 to 20 of 3374 total
Weighted quantile regression for AR model with infinite variance errors. (English)
J. Nonparametric Stat. 24, No. 3, 715-731 (2012).
1
The minimal limit point of the third largest Laplacian eigenvalues of graphs. (English)
Ars Comb. 103, 119-127 (2012).
2
Partially monotone tensor spline estimation of the joint distribution function with bivariate current status data. (English)
Ann. Stat. 40, No. 3, 1609-1636 (2012).
3
On the covering number $c_λ(3,W_4^{(3)}, v)$. (English)
Acta Math. Appl. Sin., Engl. Ser. 28, No. 4, 631-638 (2012).
4
Spectral radius of strongly connected digraphs. (English)
Discrete Math. 312, No. 24, 3663-3669 (2012).
5
Adding regular expressions to graph reachability and pattern queries. (English)
Front. Comput. Sci. 6, No. 3, 313-338 (2012).
6
An incomplete $m$-exchange algorithm for solving the large-scale multi-scenario knapsack problem. (English)
Comput. Oper. Res. 39, No. 9, 1988-2000 (2012).
7
A new approach for analyzing the reliability of the repair facility in a series system with vacations. (English)
J. Appl. Math. 2012, Article ID 182975, 16 p. (2012).
8
Application of adaptive quantum particle swarm optimization algorithm for optimal dispatching of cascaded hydropower stations. (English)
Huang, De-Shuang (ed.) et al., Intelligent computing theories and applications. 8th international conference, ICIC 2012, Huangshan, China, July 25‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31575-6/pbk). Lecture Notes in Computer Science 7390. Lecture Notes in Artificial Intelligence, 463-470 (2012).
9
Semi-supervised vehicle recognition: an approximate region constrained approach. (English)
Li, Tianrui (ed.) et al., Rough sets and knowledge technology. 7th international conference, RSKT 2012, Chengdu, China, August 17‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31899-3/pbk). Lecture Notes in Computer Science 7414. Lecture Notes in Artificial Intelligence, 161-166 (2012).
10
Sample size selection in optimization methods for machine learning. (English)
Math. Program. 134, No. 1 (B), 127-155 (2012).
11
Inapproximability of treewidth, one-shot pebbling, and related layout problems. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 13-24 (2012).
12
A multi-level ant-colony mining algorithm for membership functions. (English)
Inf. Sci. 182, No. 1, 3-14 (2012).
13
Fixation probabilities on complete star and bipartite digraphs. (English)
Discrete Dyn. Nat. Soc. 2012, Article ID 940465, 21 p. (2012).
14
A stochastic dynamic model of computer viruses. (English)
Discrete Dyn. Nat. Soc. 2012, Article ID 264874, 16 p. (2012).
15
An impulse model for computer viruses. (English)
Discrete Dyn. Nat. Soc. 2012, Article ID 260962, 13 p. (2012).
16
Distance spectral spread of a graph. (English)
Discrete Appl. Math. 160, No. 16-17, 2474-2478 (2012).
17
Laplacian centrality: A new centrality measure for weighted networks. (English)
Inf. Sci. 194, 240-253 (2012).
18
A revision of some single-machine and $m$-machine flowshop scheduling problems with learning considerations. (English)
Inf. Sci. 190, 227-232 (2012).
19
R-NoC: an efficient packet-switched reconfigurable networks-on-chip. (English)
Choy, Oliver C. S. (ed.) et al., Reconfigurable computing: Architectures, tools and applications. 8th international symposium, ARC 2012, Hong Kong, China, March 19‒23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28364-2/pbk). Lecture Notes in Computer Science 7199, 365-371 (2012).
20
Result 1 to 20 of 3374 total
Start
Contact
Print
General Help
