[3] Kolchin, V. F. and Khokhlov, V. I. (1990) On the number of cycles in a non-equiprobably random graph. Diskretnaya Matematika 2(3) 137-145 (in Russian).

Google Scholar

Cited By

View all

Blass ENoubir G(2023)Forward Security with Crash Recovery for Secure LogsACM Transactions on Privacy and Security10.1145/363152427:1(1-28)Online publication date: 3-Nov-2023
https://dl.acm.org/doi/10.1145/3631524
Neuen DSchweitzer PDiakonikolas IKempe DHenzinger M(2018)An exponential lower bound for individualization-refinement algorithms for graph isomorphismProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188900(138-150)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188900
Bazzi LAudah H(2015)Impact of Redundant Checks on the LP Decoding Thresholds of LDPC CodesIEEE Transactions on Information Theory10.1109/TIT.2015.241752261:5(2240-2255)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1109/TIT.2015.2417522
Show More Cited By

Recommendations

Distance-increasing mappings from binary vectors to constant composition vectors
ISIT'09: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4

A distance-preserving mapping is a one-to-one function f from p-ary vectors of length m to q-ary vectors of length n such that any two distinct p-ary vectors are mapped to two different q-ary vectors with an equal or greater Hamming distance. A special ...
Optimal ternary constant-weight codes of weight four and distance six

Recently, Chee and Ling ("Constructions for q-ary constant-weight codes", IEEE Trans. Inf. Theory, vol. 53, no. 1, 135-146, Jan. 2007) introduced a new combinatorial construction for q-ary constant-weight codes which reveals a close connection between q-...
Reducing SVR Support Vectors by Using Backward Deletion
KES '08: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III

Support Vector Regression (SVR) is one of the most famous sparse kernel machines which inherits many advantages of Support Vector Machines (SVM). However, since the number of support vectors grows rapidly with the increase of training samples, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Combinatorics, Probability and Computing

Combinatorics, Probability and Computing Volume 6, Issue 3

September 1997

112 pages

ISSN:0963-5483

Issue’s Table of Contents

Publisher

Cambridge University Press

United States

Publication History

Published: 01 September 1997

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Blass ENoubir G(2023)Forward Security with Crash Recovery for Secure LogsACM Transactions on Privacy and Security10.1145/363152427:1(1-28)Online publication date: 3-Nov-2023
https://dl.acm.org/doi/10.1145/3631524
Neuen DSchweitzer PDiakonikolas IKempe DHenzinger M(2018)An exponential lower bound for individualization-refinement algorithms for graph isomorphismProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188900(138-150)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188900
Bazzi LAudah H(2015)Impact of Redundant Checks on the LP Decoding Thresholds of LDPC CodesIEEE Transactions on Information Theory10.1109/TIT.2015.241752261:5(2240-2255)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1109/TIT.2015.2417522
Aumüller MDietzfelbinger MWoelfel P(2012)Explicit and efficient hash families suffice for cuckoo hashing with a stashProceedings of the 20th Annual European conference on Algorithms10.1007/978-3-642-33090-2_11(108-120)Online publication date: 10-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33090-2_11
Dietzfelbinger MGoerdt AMitzenmacher MMontanari APagh RRink M(2010)Tight thresholds for cuckoo hashing via XORSATProceedings of the 37th international colloquium conference on Automata, languages and programming10.5555/1880918.1880943(213-225)Online publication date: 6-Jul-2010
https://dl.acm.org/doi/10.5555/1880918.1880943
Dietzfelbinger MPagh R(2008)Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part I10.1007/978-3-540-70575-8_32(385-396)Online publication date: 7-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-70575-8_32

Abstract

References

Cited By

Recommendations

Distance-increasing mappings from binary vectors to constant composition vectors

Optimal ternary constant-weight codes of weight four and distance six

Reducing SVR Support Vectors by Using Backward Deletion

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations