Search the dblp DataBase
Bill G. Horne :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Bill G. Horne , Lesley R. Matheson , Casey Sheehan , Robert Endre Tarjan Dynamic Self-Checking Techniques for Improved Tamper Resistance. [Citation Graph (0, 0)][DBLP ] Digital Rights Management Workshop, 2001, pp:141-159 [Conf ] Stuart Haber , Bill G. Horne , Joe Pato , Tomas Sander , Robert Endre Tarjan If Piracy Is the Problem, Is DRM the Answer? [Citation Graph (0, 0)][DBLP ] Digital Rights Management, 2003, pp:224-233 [Conf ] M. F. Sakr , Steven P. Levitan , Donald M. Chiarulli , Bill G. Horne , C. Lee Giles Predicting Multiprocessor Memory Access Patterns with Learning Models. [Citation Graph (0, 0)][DBLP ] ICML, 1997, pp:305-312 [Conf ] Kam-Chuen Jim , Bill G. Horne , C. Lee Giles Effects of Noise on Convergence and Generalization in Recurrent Networks. [Citation Graph (0, 0)][DBLP ] NIPS, 1994, pp:649-656 [Conf ] Daniel S. Clouse , C. Lee Giles , Bill G. Horne , Garrison W. Cottrell Representation and Induction of Finite State Machines using Time-Delay Neural Networks. [Citation Graph (0, 0)][DBLP ] NIPS, 1996, pp:403-409 [Conf ] Bill G. Horne , C. Lee Giles An experimental comparison of recurrent neural networks. [Citation Graph (0, 0)][DBLP ] NIPS, 1994, pp:697-704 [Conf ] Bill G. Horne , Don R. Hush Bounds on the Complexity of Recurrent Neural Network Implementations of Finite State Machines. [Citation Graph (0, 0)][DBLP ] NIPS, 1993, pp:359-366 [Conf ] Don R. Hush , Fernando Lozano , Bill G. Horne Function Approximation with the Sweeping Hinge Algorithm. [Citation Graph (0, 0)][DBLP ] NIPS, 1997, pp:- [Conf ] Laurens R. Leerink , C. Lee Giles , Bill G. Horne , Marwan A. Jabri Learning with Product Units. [Citation Graph (0, 0)][DBLP ] NIPS, 1994, pp:537-544 [Conf ] Tsungnan Lin , Bill G. Horne , Peter Tiño , C. Lee Giles Learning long-term dependencies is not as difficult with NARX networks. [Citation Graph (0, 0)][DBLP ] NIPS, 1995, pp:577-583 [Conf ] Bill G. Horne , Benny Pinkas , Tomas Sander Escrow services and incentives in peer-to-peer networks. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2001, pp:85-94 [Conf ] Bill G. Horne , Hava T. Siegelmann , C. Lee Giles What NARX Networks Can Compute. [Citation Graph (0, 0)][DBLP ] SOFSEM, 1995, pp:95-102 [Conf ] Peter Tiño , Bill G. Horne , C. Lee Giles Attractive Periodic Sets in Discrete-Time Recurrent Networks (with Emphasis on Fixed-Point Stability and Bifurcations in Two-Neuron Networks). [Citation Graph (0, 0)][DBLP ] Neural Computation, 2001, v:13, n:6, pp:1379-1414 [Journal ] C. Lee Giles , Bill G. Horne , Tsungnan Lin Learning a class of large finite state machines with a recurrent neural network. [Citation Graph (0, 0)][DBLP ] Neural Networks, 1995, v:8, n:9, pp:1359-1365 [Journal ] Bill G. Horne , Don R. Hush On the node complexity of neural networks. [Citation Graph (0, 0)][DBLP ] Neural Networks, 1994, v:7, n:9, pp:1413-1426 [Journal ] Bill G. Horne , Don R. Hush Bounds on the complexity of recurrent neural network implementations of finite state machines. [Citation Graph (0, 0)][DBLP ] Neural Networks, 1996, v:9, n:2, pp:243-252 [Journal ] Tsungnan Lin , Bill G. Horne , C. Lee Giles How embedded memory in recurrent neural network architectures helps learning long-term temporal dependencies. [Citation Graph (0, 0)][DBLP ] Neural Networks, 1998, v:11, n:5, pp:861-868 [Journal ] Frank L. Lewis , Bill G. Horne , Chaouki T. Abdallah Computational complexity of determining resource loops in re-entrant flow lines. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Systems, Man, and Cybernetics, Part A, 2000, v:30, n:2, pp:222-229 [Journal ] Hava T. Siegelmann , Bill G. Horne , C. Lee Giles Computational capabilities of recurrent NARX neural networks. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1997, v:27, n:2, pp:208-215 [Journal ] Search in 0.066secs, Finished in 0.067secs