Result 1 to 20 of 121 total
Tile-packing tomography is $\Bbb{NP}$-hard. (English)
Algorithmica 64, No. 2, 267-278 (2012).
1
Distinguishing trees in linear time. (English)
Electron. J. Comb. 19, No. 2, Research Paper P19, 9 p., electronic only (2012).
2
An overview of techniques for detecting software variability concepts in source code. (English)
De Troyer, Olga (ed.) et al., Advances in conceptual modeling. Recent developments and new directions. ER 2011 workshops FP-UML, MoRE-BI, Onto-CoM, SeCoGIS, Variability@ER, WISM, Brussels, Belgium, October 31 ‒ November 3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24573-2/pbk). Lecture Notes in Computer Science 6999, 141-150 (2011).
3
Total coloring of block-cactus graphs. (English)
J. Comb. Math. Comb. Comput. 78, 273-283 (2011).
4
Diagnosing and correcting design inconsistencies in source code with logical abduction. (English)
Sci. Comput. Program. 76, No. 12, 1113-1129 (2011).
5
Group orthogonal matching pursuit for logistic regression (English)
Journal of Machine Learning Research - Proceedings Track 15, 452-460 (2011).
6
Temporal graphical models for cross-species gene regulatory network discovery (English)
J. Bioinformatics and Computational Biology 9, No. 2, 231-250 (2011).
7
Mendel: source code recommendation based on a genetic metaphor (English)
ASE, 384-387 (2011).
8
Engineering a topological sorting algorithm for massive graphs (English)
ALENEX, 139-150 (2011).
9
An overview of techniques for detecting software variability concepts in source code (English)
ER Workshops, 141-150 (2011).
10
The $k$-centrum straight-line location problem. (English)
J. Math. Model. Algorithms 9, No. 1, 1-17 (2010).
11
Sampling for information and structure preservation when mining large data bases. (English)
Kuri-Morales, Angel (ed.) et al., Advances in artificial intelligence ‒ IBERAMIA 2010. 12th Ibero-American conference on AI, Bahía Blanca, Argentina, November 1‒5, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16951-9/pbk). Lecture Notes in Computer Science 6433. Lecture Notes in Artificial Intelligence, 174-183 (2010).
12
Mining frequent closed rooted trees. (English)
Mach. Learn. 78, No. 1-2, 1-33 (2010).
13
Tile-packing tomography is ${\mathbb{NP}}$-hard. (English)
Thai, My T. (ed.) et al., Computing and combinatorics. 16th annual international conference, COCOON 2010, Nha Trang, Vietnam, July 19‒21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14030-3/pbk). Lecture Notes in Computer Science 6196, 254-263 (2010).
14
Mutual information of IID complex Gaussian signals on block Rayleigh-faded channels. (English)
Comput. Res. Repos. 2010, Article No. 1001.2283 (2010).
15
Finding an Euclidean anti-$k$-centrum location of a set of points. (English)
Comput. Oper. Res. 37, No. 2, 292-301 (2010).
16
A unified treatment of optimum pilot overhead in multipath fading channels (English)
IEEE Transactions on Communications 58, No. 10, 2939-2948 (2010).
17
Per-antenna rate and power control for MIMO layered architectures in the low- and high-power regimes (English)
IEEE Transactions on Communications 58, No. 2, 652-659 (2010).
18
The $k$-centrum straight-line location problem (English)
J. Math. Model. Algorithms 9, No. 1, 1-17 (2010).
19
Transmit diversity vs. Spatial multiplexing in modern MIMO systems (English)
IEEE Transactions on Wireless Communications 9, No. 1, 186-197 (2010).
20
Result 1 to 20 of 121 total
Start
Contact
Print
General Help
