Efficient data structures for sparse network representation

Author： Hyvonen Jorkki Saramaki Jari Kaski Kimmo

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.85, Iss.8, 2008-08, pp. : 1219-1233

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient data structures for backtrack search SAT solvers

By Lynce Inês

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1, 2005-01 ,pp. : 137-152

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Data Structures for Backtrack Search SAT Solvers

By Lynce Inês

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1-4, 2005-01 ,pp. : 137-152

Springer Publishing Company

Access to resources Recommend Favorite

Secure and efficient data collection in wireless image sensor network based on ellipse batch dispersive routing

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 8, Iss. 14, 2015-09 ,pp. : 2420-2430

John Wiley & Sons Inc

Access to resources Recommend Favorite

Application of super‐resolution reconstruction of sparse representation in mass spectrometry imaging

RAPID COMMUNICATIONS IN MASS SPECTROMETRY, Vol. 29, Iss. 12, 2015-06 ,pp. : 1178-1184

John Wiley & Sons Inc

Access to resources Recommend Favorite

Sparse data in the evolutionary generation of fuzzy models

By Spiegel D. Sudkamp T.

Fuzzy Sets and Systems, Vol. 138, Iss. 2, 2003-09 ,pp. : 363-379

Elsevier

Access to resources Recommend Favorite