MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Most Cited Computer Science Articles generated from documents in the CiteSeerx database as of November 5, 2009. This list is automatically generated and may contain errors. The list is generated in batch mode and citation counts may differ from those currently in the CiteSeerx database, since the database is continuously updated.

Next 100 View Next Page
  1. 4735 A Dempster, N Laird, D Rubin. Maximum Likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B, , 1977.
  2. 2751 C A R Hoare. Communicating Sequential Processes. Communications of ACM, , 1978.
  3. 2526 J R Quinlan. Induction of decision trees. Machine Learning, , 1986.
  4. 2394 Ion Stoica, Robert Morris, David Karger, M Frans Kaashoek, Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. ACM SIGCOMM 2001, , 2001.
  5. 2372 L R Rabiner. A tutorial on hidden Markov Models and selected applications in speech recognition. Proceedings of the IEEE, Vol 77, , 1989.
  6. 2348 R E Bryant. Graph-based algorithms for boolean function manipulations. IEEE Transactions on Computers, , 1986.
  7. 2331 S Kirkpatrick, C Gelatt, M Vecchi. Optimization by Simulated Annealing. Science, , 1983.
  8. 2271 C L Liu, J W Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the Association for Computing Machinery, , 1973.
  9. 2091 R L Rivest, A Shamir, L M Adleman. A method for obtaining digital signatures and public-key cryptosystems. IBM Zu"rich Research Lab, , 1997.
  10. 2067 M Kass, A Witkin, D Terzopoulos. Snakes: Active contour models. Int J Comp Vis, , 1988.
  11. 1950 Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard M Karp. A scalable Content-Addressable Network. In Proc. ACM SIGCOMM 2001, , 2001.
  12. 1933 R S Sutton, A G Barto. Reinforcement Learning: An introduction. , 1998.
  13. 1876 W Diffie, M Hellman. New directions in cryptogra-phy. IEEE Trans. Info. Theory, , 1976.
  14. 1839 S Brin, L Page. The anatomy of a large-scale hypertextual Web search engine. In Proc. of WWW ’98, , 1998.
  15. 1813 M Turk, A Pentland. Eigenfaces for recognition. Journal of Cognitive Neuroscience, , 1991.
  16. 1752 D Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming, , 1987.
  17. 1738 S Floyd, V Jacobson. Random Early Detections Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking, , 1993.
  18. 1735 R Agrawal, R Srikant. Fast Algorithms for Mining Association Rules. In: Proceedings of the 20th International Conference on Very Large Databases, , 1994.
  19. 1709 A Guttman. R-trees: a dynamic index structure for spatialsearching. In Proc. ACM SIGMOD, , 1984.
  20. 1696 L A Zadeh. Fuzzy sets. Inform. Control, , 1965.
  21. 1669 J Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, , 1999.
  22. 1640 A J Menezes, P C van Oorschot, S A Vanstone. Handbook of Applied Cryptography. , 1996.
  23. 1636 S Deerwester, S Dumais, G Furnas, T Landauer, R Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, , 1990.
  24. 1610 C H Papadimitriou. Computational Complexity. , 1994.
  25. 1588 S Mallat. A theory for multiresolution signal decomposition: The wavelet representation. IEEE Trans. Pattern Anal. Mach. Intell, , 1989.
  26. 1578 E M Clarke, O Grumberg, D Peled. Model Checking. , 2000.
  27. 1565 L Breiman. Bagging predictors. Machine Learning, , 1996.
  28. 1521 R Agrawal, T Imielinski, A Swami. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, , 1993.
  29. 1505 D Johnson, D Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. Mobile Computing, Kluwer, , 1996.
  30. 1504 T Gruber. A Translation Approach to Portable Ontology Specifications.” Knowledge Acquisitions 5. ISO 10303-22, “Industrial automation systems and integration – Product data representation and exchange – Part 21: Standard data access interface”, 1998 ISO 10303-23 , Industrial automation systems and integration – Product, , 1993.
  31. 1454 W E Lorensen, H E Cline. Marching cubes: A high resolution 3D surface construction algorithm. In Computer Graphics (SIGGRAPH ’87 Proceedings, , 1987.
  32. 1440 R Baeza-Yates, B Ribeiro-Neto. Modern Information Retrieval. , 1999.
  33. 1416 H Schulzrinne, S Casner, R Frederick, V Jacobson. RTP: a transport protocol for real-time applications. , 1998.
  34. 1408 W Leland, M Taqqu, W Willinger, D Wilson. On the self-similar nature of Ethernet traffic (extended version. IEEE/ACM Transactions on Networking, , 1994.
  35. 1405 A Parekh, R Gallager. A Generalized Processor Sharing Approach to Flow Control – the Single Node Case. IEEE/ACM Transactions on Networking, , 1993.
  36. 1363 R Alur, D Dill. A theory of timed automata. , 1994.
  37. 1359 S F Altschul, T L Madden, A A Schaffer, J Zhang, Z Zhang, W Miller, D J Lipman. Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucleic Acids Research, , 1997.
  38. 1356 D Burger, T Austin. The SimpleScalar Tool Set, Version 2.0. , 1997.
  39. 1331 I Foster, C Kesselman. S.Tuecke, ‘‘The anatomy of the grid: Enabling scalable virtual organizations. Int. J. High Perform. Compu. Appl, , 2001.
  40. 1307 C Perkins, E M Royer. Ad-hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, , 1999.
  41. 1295 B Stroustrup. The C+ + Programming Language. , 1986.
  42. 1284 A Rowstron, P Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. IFIP/ACM Middleware, , 2001.
  43. 1267 Andrzej Trybulec. Tarski Grothendieck set theory. Journal of Formalized Mathematics, Axiomatics, , 1989.
  44. 1243 I Foster, C Kesselman. Globus: A metacomputing infrastructure toolkit. The International Journal of Supercomputer Applications and High Performance Computing, , 1997.
  45. 1240 C J C Burges. A tutorial on support vector machines for pattern recognition. Data Min. Knowledge Discovery, , 1998.
  46. 1226 D Lowe. Distinctive image feature from scale-invariant keypoint. International Journal of Computer Vision, , 2004.
  47. 1220 J McCarthy, P Hayes. Some philosophical problems from the standpoint of arti cial intelligence. Machine Intelligence, , 1969.
  48. 1214 C Intanagonwiwat, R Govindan, D Estrin. Directed diffusion: a scalable and robust communication paradigm for sensor networks. In Proc. 6th Int. Conf. on Mobile Computing and Networking (MobiCom’00, , 2000.
  49. 1205 Y Freund, R E. Schapire, “Decision-theoretic generalization of on-line learning and application to boosting. J. Comput. Syst. Sci, , 1997.
  50. 1196 M P Marcus, M A Marcinkiewicz, B Santorini. Building a large annotated corpus of English: the penn treebank. Computational Linguistics, , 1993.
  51. 1168 P Gupta, P R Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, , 2000.
  52. 1151 J K OUSTERHOUT. Tcl and the Tk Toolkit. , 1994.
  53. 1140 J L Elman. Finding structure in time. Cognitive Sci, , 1990.
  54. 1138 Czeslaw Byli'nski. Functions and their basic properties. Journal of Formalized Mathematics, , 1989.
  55. 1136 B K P Horn, B G Schunck. Determining optical flow. Artificial Intelligence, , 1981.
  56. 1136 J Shi, J Malik. Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, , 0.
  57. 1127 M Li, P M B Vitinyi. Kolmogorov complexity and its applications. in Handbook of Theoretical Computer Sciences, Algorithmics and ComplexiO,, Volume A (Elsevier, , 1990.
  58. 1127 V Paxson, S Floyd. Wide area traffic: the failure of Poisson modeling. IEEE/ACM Transactions on Networking, , 1995.
  59. 1122 M GELFOND, V LIFSCHITZ. The Stable Model Semantics for Logic Programming. In Logic Programming: Proceedings Fifth Intl Conference and Symposium, , 1988.
  60. 1122 R Bird, P Wadler. Introduction to Functional Programming. International Series in Computer Science, , 1988.
  61. 1121 P Chen. The Entity-Relationship Model - Toward a Unified View of Data. ACM Trans. on Database Systems, , 1976.
  62. 1091 C Cortes, V Vapnik. Support-vector network. Mach. Learning, , 1995.
  63. 1078 G Kiczales, J Lamping, A Menhdhekar, C Maeda, C Lopes, J-M Loingtier, J Irwin. Aspect-oriented programming. Proceedings European Conference on Object-Oriented Programming, , 1997.
  64. 1076 T Berners-Lee, J Hendler. Lassila O.: The Semantic Web. Scientific American, , 2001.
  65. 1073 B Schölkopf, Smola. A.J.: Learning with Kernels. , 2002.
  66. 1072 A Shamir. How to Share a Secret. Commun. ACM, , 1979.
  67. 1072 George A Miller, Richard Beckwith, Christiane Fellbaum, Derek Gross, Katherine J Miller. Introduction to WordNet: An On-line Lexical Database. , 1990.
  68. 1064 L Page, S Brin, R Motwani, T Winograd. The pagerank citation ranking: Bringing order to the Web. , 1998.
  69. 1054 B Lucas, T Kanade. An iterative image registration technique with an application to stereo vision. In IJCAI81, , 1981.
  70. 1053 Thorsten Joachims. Text Categorization with Support Vector Machines: Learning with Many Relevant Features. Proc. of ECML-98, 10th European Conf. on Machine Learning, , 1998.
  71. 1052 B W Kerighan, D M Ritchie. The C Programming Language. , 1978.
  72. 1045 Y Freund, R E Schapire. Experiments with a new boosting algorithm. In Proceedings of the Thirteenth International Conference on Machine Learning, , 1996.
  73. 1044 Gordon D Plotkin. Structural approach to operational semantics. , 1981.
  74. 1040 Zinaida Trybulec. Properties of subsets. Journal of Formalized Mathematics, , 1989.
  75. 1037 R A Brooks. Intelligence without representation. Artificial Intelligence, , 1991.
  76. 1028 J Hill, R Szewczyk, A Woo, S Hollar, D Culler, K Pister. System architecture directions for network sensors. In ASPLOS, , 2000.
  77. 998 C A R Hoare. An axiomatic basis for computer programming. Comm. of the ACM, , 1969.
  78. 986 E M Clarke, E A Emerson, P Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Trans. Prog. Lang. Syst, , 1986.
  79. 977 C Perkins, P Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. in: ACM SIGCOMM’94 Conference on Communications Architectures, Protocols and Applications, , 1994.
  80. 976 J Broch, D A Maltz, D B Johnson, Y-C Hu, J Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. in: Proceedings of IEEE/ACM MOBICOM’98, , 1998.
  81. 971 G Holzmann. The Model Checker Spin. Special issue on Formal Methods in Software Practice, , 1997.
  82. 951 M J Swain, D H Ballard. Color Indexing. Computer Graphics and Image Processing, Vo1.13, , 1991.
  83. 948 Michael Burrows, Martin Abadi, Roger Needham. A logic of authentication. , 1989.
  84. 947 B Karp, H T Kung. Greedy Perimeter Stateless Routing for Wireless Networks. Proc. ACM MobiCom ’00, , 2000.
  85. 941 C Chang, C Lin. LIBSVM: a library for support vector machines. , 2001.
  86. 941 L P Kaelbling, M L Littman, A W Moore. Reinforcement learning: A survey. Journal of Artificial Intelligence Research, , 1996.
  87. 931 R Sutton. Learning to Predict by the Method of Temporal Differences. Machine Learning, , 1988.
  88. 915 G Salton, C Buckley. Term-weighting approaches in automatic text retrieval. Information Processing and Management: an International Journal, , 1988.
  89. 912 S FLOYD, V JACOBSON, S MCCANNE, C-G LIU, L ZHANG. A reliable multicast framework for lightweight sessions and application level framing. In Proceedings of SIGCOMM ’95, , 1995.
  90. 906 Czeslaw Byli'nski. Functions from a set to a set. Journal of Formalized Mathematics, , 1989.
  91. 901 Edmund Woronowicz. Relations and their basic properties. Journal of Formalized Mathematics, , 1989.
  92. 898 T R Gruber. Toward Principles for the Design of Ontologies Used for Knowledge Sharing. in Formal Ontology in Conceptual Analysis and Knowledge Representation. Eds Guarino N, Poli R, , 1993.
  93. 897 M E Crovella, A Bestavros. Self-similarity in World Wide Web traffic: evidence and possible causes. IEEE/ACM Trans. Networking, , 1997.
  94. 896 M Bellare, P Rogaway. Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. In Proc of ACM CCS '93, , 1993.
  95. 893 E A Emerson. Temporal and Modal Logic. in Handbook of Theoretical Computer Science, , 1990.
  96. 890 T von Eicken, D E Culler, S C Goldstein, K E Schauser. Active messages: A mechanism for integrated communication and computation. In 19th International Symposium on Computer Architecture, , 1992.
  97. 881 H HOPPE. Progressive meshes. Computer Graphics (SIGGRAPH ’96 Proceedings, , 1996.
  98. 877 R Atkinson. Security Architecture for the Internet Protocol,” Internet RFC 1825. , 1995.
  99. 876 S Deering. Multicast Routing in a Datagram Internetwork. , 1991.
  100. 872 A P Sheth, J A Larson. Federated database systems for managing distributed, heterogeneous, and autonomous databases. ACM Computing Surveys, , 1990.
Next 100 View Next Page