The SCEAS System
| |||||||

## Search the dblp DataBase
Ido Kanter:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Or Zuk, Ido Kanter, Eytan Domany
**Asymptotics of the Entropy Rate for a Hidden Markov Process.**[Citation Graph (0, 0)][DBLP] DCC, 2005, pp:173-182 [Conf] - Yann LeCun, Ido Kanter, Sara A. Solla
**Second Order Properties of Error Surfaces.**[Citation Graph (0, 0)][DBLP] NIPS, 1990, pp:918-924 [Conf] - Einat Klein, Rachel Mislovaty, Ido Kanter, Andreas Ruttor, Wolfgang Kinzel
**Synchronization of neural networks by mutual learning and its application to cryptography.**[Citation Graph (0, 0)][DBLP] NIPS, 2004, pp:- [Conf] - Avner Priel, Ido Kanter, David A. Kessler
**Analytical Study of the Interplay between Architecture and Predictability.**[Citation Graph (0, 0)][DBLP] NIPS, 1997, pp:- [Conf] - Avner Priel, Ido Kanter
**Time Series Generation by Recurrent Neural Networks.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2003, v:39, n:3, pp:315-332 [Journal] - Marcelo Blatt, Eytan Domany, Ido Kanter
**On the equivalence of two-layered perceptrons with binary neurons.**[Citation Graph (0, 0)][DBLP] Int. J. Neural Syst., 1995, v:6, n:3, pp:225-231 [Journal] - Ido Kanter, Haggai Kfir, Brenda Malkiel, Miriam Shlesinger
**Identifying universals of text translation.**[Citation Graph (0, 0)][DBLP] Journal of Quantitative Linguistics, 2006, v:13, n:1, pp:35-43 [Journal] - Ori Shental, Ido Kanter
**Optimum Asymptotic Multiuser Efficiency of Pseudo-Orthogonal Randomly Spread CDMA**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Einat Klein, Noam Gross, Evi Kopelowitz, Michael Rosenbluh, Lev Khaykovich, Wolfgang Kinzel, Ido Kanter
**Public-channel cryptography based on mutual chaos pass filters**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Nadav Yacov, Hadar Efraim, Haggai Kfir, Ido Kanter, Ori Shental
**Parallel vs. Sequential Belief Propagation Decoding of LDPC Codes over GF(q) and Markov Sources**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **The Entropy of a Binary Hidden Markov Process**[Citation Graph (, )][DBLP]**Capacity of Complexity-Constrained Noise-Free CDMA**[Citation Graph (, )][DBLP]**On the Achievable Information Rates of CDMA Downlink with Trivial Receivers**[Citation Graph (, )][DBLP]**Taylor series expansions for the entropy rate of Hidden Markov Processes**[Citation Graph (, )][DBLP]**From finite-system entropy to entropy rate for a Hidden Markov Process**[Citation Graph (, )][DBLP]**Shannon Meets Carnot: Mutual Information Via Thermodynamics**[Citation Graph (, )][DBLP]**Carnot in the Information Age: Discrete Symmetric Channels**[Citation Graph (, )][DBLP]**An efficient CDMA decoder for correlated information sources**[Citation Graph (, )][DBLP]
Search in 0.267secs, Finished in 0.268secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |