default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRustem Takhanov
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Rustem Takhanov
:
Almost pairwise independence and resilience to deep learning attacks. IACR Commun. Cryptol. 1(3): 32 (2024)- [c16]Rustem Takhanov:
On the Induced Problem for Fixed-Template CSPs. SOFSEM 2024: 485-499 - [i26]Rustem Takhanov:
Multi-layer random features and the approximation power of neural networks. CoRR abs/2404.17461 (2024) - 2023
- [j10]Rustem Takhanov:
The algebraic structure of the densification and the sparsification tasks for CSPs. Constraints An Int. J. 28(1): 13-44 (2023) - [j9]Rustem Takhanov:
Reducing the dimensionality of data using tempered distributions. Digit. Signal Process. 133: 103819 (2023) - [j8]Rustem Takhanov:
Computing a Partition Function of a Generalized Pattern-Based Energy over a Semiring. Theory Comput. Syst. 67(4): 760-784 (2023) - [j7]Rustem Takhanov, Y. Sultan Abylkairov, Maxat Tezekbayev:
Autoencoders for a manifold learning problem with a jacobian rank constraint. Pattern Recognit. 143: 109777 (2023) - [c15]Artur Pak, Sultan Nurmukhamedov, Rustem Takhanov, Zhenisbek Assylbekov:
Hardness of Learning AES Key (Student Abstract). AAAI 2023: 16296-16297 - [c14]Rustem Takhanov, Maxat Tezekbayev, Artur Pak, Arman Bolatov, Zhibek Kadyrsizova, Zhenisbek Assylbekov:
Intractability of Learning the Discrete Logarithm with Gradient-Based Methods. ACML 2023: 1321-1336 - [i25]Rustem Takhanov:
Computing a partition function of a generalized pattern-based energy over a semiring. CoRR abs/2305.17526 (2023) - [i24]Rustem Takhanov, Y. Sultan Abylkairov, Maxat Tezekbayev:
Autoencoders for a manifold learning problem with a Jacobian rank constraint. CoRR abs/2306.14194 (2023) - [i23]Rustem Takhanov, Maxat Tezekbayev, Artur Pak, Arman Bolatov, Zhibek Kadyrsizova, Zhenisbek Assylbekov:
Intractability of Learning the Discrete Logarithm with Gradient-Based Methods. CoRR abs/2310.01611 (2023) - [i22]Rustem Takhanov, Maxat Tezekbayev, Artur Pak, Arman Bolatov, Zhenisbek Assylbekov:
Gradient Descent Fails to Learn High-frequency Functions and Modular Arithmetic. CoRR abs/2310.12660 (2023) - 2022
- [j6]Rustem Takhanov, Vladimir Kolmogorov:
Combining pattern-based CRFs and weighted context-free grammars. Intell. Data Anal. 26(1): 257-272 (2022) - [j5]Zhalgas Mukanov, Rustem Takhanov:
Learning the pattern-based CRF for prediction of a protein local structure. Informatica (Slovenia) 46(6) (2022) - [c13]Sultan Nurmukhamedov, Artur Pak, Rustem Takhanov, Zhenisbek Assylbekov:
Hardness of Learning AES Key (Short Paper). DP@AI*IA 2022: 42-47 - [i21]Rustem Takhanov:
Spectral bounds of the ε-entropy of kernel classes. CoRR abs/2204.04512 (2022) - [i20]Rustem Takhanov:
On the speed of uniform convergence in Mercer's theorem. CoRR abs/2205.00487 (2022) - 2021
- [j4]Abylay Zhumekenov, Rustem Takhanov, Alejandro J. Castro, Zhenisbek Assylbekov:
Approximation error of Fourier neural networks. Stat. Anal. Data Min. 14(3): 258-270 (2021) - [i19]Rustem Takhanov:
The algebraic structure of the densification and the sparsification tasks for CSPs. CoRR abs/2104.05065 (2021) - [i18]Rustem Takhanov:
How many moments does MMD compare? CoRR abs/2106.14277 (2021) - 2020
- [j3]Malika Uteuliyeva, Abylay Zhumekenov, Rustem Takhanov, Zhenisbek Assylbekov, Alejandro J. Castro, Olzhas Kabdolov:
Fourier neural networks: A comparative study. Intell. Data Anal. 24(5): 1107-1120 (2020) - [c12]Maxat Tezekbayev, Zhenisbek Assylbekov, Rustem Takhanov:
Semantics- and Syntax-Related Subvectors in the Skip-Gram Embeddings (Student Abstract). AAAI 2020: 13937-13938 - [c11]Zhenisbek Assylbekov, Rustem Takhanov:
Context Vectors Are Reflections of Word Vectors in Half the Dimensions (Extended Abstract). IJCAI 2020: 5115-5119
2010 – 2019
- 2019
- [j2]Zhenisbek Assylbekov, Rustem Takhanov:
Context Vectors are Reflections of Word Vectors in Half the Dimensions. J. Artif. Intell. Res. 66: 225-242 (2019) - [c10]Bagdat Myrzakhmetov, Rustem Takhanov, Zhenisbek Assylbekov:
Initial Explorations on Chaotic Behaviors of Recurrent Neural Networks. CICLing (1) 2019: 351-363 - [i17]Abylay Zhumekenov, Malika Uteuliyeva, Olzhas Kabdolov, Rustem Takhanov, Zhenisbek Assylbekov, Alejandro J. Castro:
Fourier Neural Networks: A Comparative Study. CoRR abs/1902.03011 (2019) - [i16]Zhenisbek Assylbekov, Rustem Takhanov:
Context Vectors are Reflections of Word Vectors in Half the Dimensions. CoRR abs/1902.09859 (2019) - [i15]Rustem Takhanov:
Dimension reduction as an optimization problem over a set of generalized functions. CoRR abs/1903.05083 (2019) - [i14]Maxat Tezekbayev, Zhenisbek Assylbekov, Rustem Takhanov:
Semantics- and Syntax-related Subvectors in the Skip-gram Embeddings. CoRR abs/1912.13413 (2019) - 2018
- [c9]Olzhas Kabdolov, Zhenisbek Assylbekov, Rustem Takhanov:
Reproducing and Regularizing the SCRN Model. COLING 2018: 1705-1716 - [c8]Zhenisbek Assylbekov, Rustem Takhanov:
Reusing Weights in Subword-Aware Neural Language Models. NAACL-HLT 2018: 1413-1423 - [i13]Zhenisbek Assylbekov, Rustem Takhanov:
Reusing Weights in Subword-aware Neural Language Models. CoRR abs/1802.08375 (2018) - [i12]Rustem Takhanov:
Fourier analysis perspective for sufficient dimension reduction problem. CoRR abs/1808.06191 (2018) - 2017
- [c7]Zhenisbek Assylbekov, Rustem Takhanov, Bagdat Myrzakhmetov, Jonathan North Washington:
Syllable-aware Neural Language Models: A Failure to Beat Character-aware Ones. EMNLP 2017: 1866-1872 - [c6]Rustem Takhanov, Zhenisbek Assylbekov:
Patterns Versus Characters in Subword-Aware Neural Language Modeling. ICONIP (2) 2017: 157-166 - [c5]Rustem Takhanov:
Hybrid VCSPs with Crisp and Valued Conservative Templates. ISAAC 2017: 65:1-65:13 - [i11]Zhenisbek Assylbekov, Rustem Takhanov, Bagdat Myrzakhmetov, Jonathan North Washington:
Syllable-aware Neural Language Models: A Failure to Beat Character-aware Ones. CoRR abs/1707.06480 (2017) - [i10]Rustem Takhanov:
Searching for an algebra on CSP solutions. CoRR abs/1708.08292 (2017) - [i9]Rustem Takhanov, Zhenisbek Assylbekov:
Patterns versus Characters in Subword-aware Neural Language Modeling. CoRR abs/1709.00541 (2017) - 2016
- [j1]Vladimir Kolmogorov, Rustem Takhanov:
Inference Algorithms for Pattern-Based CRFs on Sequence Data. Algorithmica 76(1): 17-46 (2016) - 2015
- [c4]Vladimir Kolmogorov, Michal Rolínek, Rustem Takhanov:
Effectiveness of Structural Restrictions for Hybrid CSPs. ISAAC 2015: 566-577 - [i8]Vladimir Kolmogorov, Michal Rolínek, Rustem Takhanov:
Effectiveness of Structural Restrictions for Hybrid CSPs. CoRR abs/1504.07067 (2015) - [i7]Rustem Takhanov:
Hybrid (V)CSPs and algebraic reductions. CoRR abs/1506.06540 (2015) - 2014
- [i6]Vladimir Kolmogorov, Christoph H. Lampert, Emilie Morvant, Rustem Takhanov:
Proceedings of The 38th Annual Workshop of the Austrian Association for Pattern Recognition (ÖAGM), 2014. CoRR abs/1404.3538 (2014) - [i5]Rustem Takhanov, Vladimir Kolmogorov:
Combining pattern-based CRFs and weighted context-free grammars. CoRR abs/1404.5475 (2014) - 2013
- [c3]Rustem Takhanov, Vladimir Kolmogorov:
Inference algorithms for pattern-based CRFs on sequence data. ICML (3) 2013: 145-153 - 2012
- [i4]Rustem Takhanov, Vladimir Kolmogorov:
Inference algorithms for pattern-based CRFs on sequence data. CoRR abs/1210.0508 (2012) - [i3]Rustem Takhanov:
Extensions of the Minimum Cost Homomorphism Problem. CoRR abs/1210.2260 (2012) - 2010
- [c2]Rustem Takhanov:
Extensions of the Minimum Cost Homomorphism Problem. COCOON 2010: 328-337 - [c1]Rustem Takhanov:
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem. STACS 2010: 657-668
2000 – 2009
- 2007
- [i2]Rustem Takhanov:
On the monotonization of the training set. CoRR abs/0705.2765 (2007) - [i1]Rustem Takhanov:
On predicate constraints with efficiently solvable task of fitting to training set. CoRR abs/0708.3226 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
