Most cited articles in Computer Science - 201 to 400 - September 2006 (CiteSeer.Continuity)

Generated from documents in the CiteSeer.Continuity database. This list does not include citations where one or more authors of the citing and cited articles match. 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 CiteSeer.Continuity database, because the database is continuously updated.

All Years   1990   1991   1992   1993   1994   1995   1996   1997   1998   1999   2000   2001   2002   2003   2004   2005   2006  

Next 200     Previous 200

201.   Book   Context   525   [4] C. Szyperski, Component Software - Beyond Object-Oriented Programming, Addison-Wesley, 1998, ISBN 0-201-17888-5.

202.   Doc     Context   524   [LLM88] M. J. Litzkow, M. Livny, and M. W. Mutka. Condor - A hunter of idle workstations. In Proceedings of the 8th Internation Conference on Distributed Computer Systems, 1988.

203.   Doc     Context   523   [3] S. A. Cook, "The complexity of theorem proving procedures," Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (1971), pp. 151--158.

204.   Doc     Context   522   21. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46--57, 1977.

205.   Doc     Context   522   [5] M. E. Crovella and A. Bestavros. Self-similarity in world wide web traffic evidence and possible causes. In Proceedings of the ACM SIGMETRICS 96, pages 160--169, Philadelphia, PA, May 1996.

206.   Doc     Context   520   [19] Perona, P. and Malik, J. "Scale Space and Edge Detection using Anisotropic Diffusion," Proceedings Workshop on Computer vision, p.16-22, 1987.

207.   Book   Context   520   [6] R.O. Duda and P.E. Hart. Pattern Classification. New York: John Wiley and Sons, 1973.

208.   Doc     Context   520   [13] D.G. Luenberger (1984). Linear and Nonlinear Programming, Second Edition, AddisonWesley.

209.   Doc     Context   519   Valiant, L.G. (1984) "A theory of the learnable," Communications of the ACM 27(11): 1134--1142.

210.   Doc     Context   518   [1] B. Efron and R. Tibshirani, An Introduction to the Bootstrap. Chapman-Hall (1993).

211.   Doc     Context   518   Kolodner, J. (1993). Case-Based Reasoning. Morgan Kaufman, San Mateo, CA.

212.   Doc     Context   515   [1] D.H. Ballard and C.M. Brown. Computer Vision. Prentice-Hall, 1982.

213.   Doc     Context   515   [14] Y. Linde, A. Buzo and R.M. Gray, "An Algorithm for Vector Quantizer Design," IEEE Trans. Communications, pp. 84--95, Jan. 1980.

214.   Doc     Context   514   [15] C. E. Perkins, "Ad-hoc on-demand distance vector routing," in MILCOM '97 panel on Ad Hoc Networks, Nov. 1997.

215.   Doc     Context   506   L. A. Zadeh. Fuzzy sets. Information and Control, 8:338--353, 1965.

216.   Doc     Context   505   [11] L. Kleinrock, "Queueing Systems," VOL. 1, New York: Wiley, 1976.

217.   Doc     Context   505   Adams, R.A. (1975), Sobolev Spaces, Academic Press--New York.

218.   Doc     Context   505   [17] L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronisation. IEEE Transactions on Computers, pages 11751185, September 1990.

219.   Doc     Context   505   [9] Howard, J. H., Kazar, M. L, et. al. "Scale and Performance in a Distributed File System," ACM Trans. on Computer Systems, 6(1):51-81, 1988.

220.   Doc     Context   504   [9] B. W. Silverman. Density Estimation for Statistics and Data Analysis, New York: Chapman and Hall, 1986.

221.   Doc     Context   500   [4] W. Gropp, E. Lusk, and A. Skjellum, Using MPI: Portable Parallel Programming with the Message Passing Interface, MIT Press, 1994.

222.   Doc     Context   499   [6] Deering, S. Host Extensions for IP Multicasting. RFC 1112, Request for Comments, Aug. 1989.

223.   Doc     Context   495   Huber, P. J. (1981). Robust Statistics. Wiley, New York.

224.   Doc     Context   494   [35] Raj Jain. The Art of Computer Systems Performance Analysis. John Wiley & Sons, Inc., New York, New York, 1991.

225.   Book   Context   493   [3] Davey B. A., and Priestley H. A., Introduction to Lattices and Order, Cambridge University Press, (1990).

226.   Doc     Context   493   [12] N.H.Hamann et al., Nucl.Instr. and Meth. A346 (1994) 57.

227.   Book   Context   491   [14] B. Mandelbrot, Fractal Geometry of Nature (Freeman, New York, 1982).

228.   Doc     Context   490   [3] A. Goldberg and D. Robson, Smalltalk 80: The language and its implementation, AddisonWesley, Reading, MA, 1983.

229.   Doc     Context   490   [5] C. Cortes and V. Vapnik, Support-Vector Networks, Machine Learning, 20(3):273-297, September 1995

230.   Doc     Context   489   [Par81] D. Park. Concurrency and Automata on Infinite Sequences. In Proceedings of GI. LNCS n. 104, Springer Verlag, 1981.

231.   Doc     Context   488   [7] A. P. Sheth & J. A. Larson, "Federated database systems for managing distributed, heterogeneous and autonomous databases," ACM Computing Surveys 22 (September 1990), 183--236.

232.   Doc     Context   488   [Bry92] Randall Y. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. Technical report, CMU, 1992.

233.   Book   Context   487   [15] F.P. Preparata and M.I. Shamos, Computational Geometry, An Introduction, SpringerVerlag, New York, 1985.

234.   Book   Context   485   [1] Andrew W. Appel. Compiling with Continuations. Cambridge University Press, New York, 1992.

235.   Doc     Context   485   [13] Constable, R. L., et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, 1986.

236.   Doc     Context   483   [12] D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Proceedings 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, May 1993.

237.   Doc     Context   482   [43] J. R. Quinlan, Learning Logical Definitions from Relations, Machine Learning 5 (1990) 239-- 266.

238.   Doc     Context   482   Statistics, 33, 1065-1076. Ripley, B. D., 1996: Pattern Recognition and Neural Networks. Cambridge: University Press.

239.   Doc     Context   481   [14] James J. Kistler and M. Satyanarayanan. Disconnected Operation in the Coda File System. ACM Transactions on Computer Systems, pages 6(1):1-- 25, February 1992.

240.   Doc     Context   480   [37] J. Singh, W. Weber, and A. Gupta. SPLASH: Stanford parallel applications for shared memory. Computer Architecture News, 20(1):5--44, March 1992.

241.   Book   Context   480   [28] G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley, 1988.

242.   Doc     Context   479   [14] D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202--208, 1985.

243.   Doc     Context   478   [24] Guy L. Steele, Jr. Common Lisp: The Language. Digital Press, 2nd edition, 1990.

244.   Book   Context   478   [13] J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, New York, Academic Press, 1970.

245.   Doc     Context   476   [11] S. Mallat, A wavelet tour of signal processing, Chapter VI, Academic Press, 1998.

246.   Book   Context   475   [4] Ljung L., System Identification: Theory for the User, Prentice-Hall, Englewood Cliffs, New Jersey, 1987.

247.   Doc     Context   474   3. S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. In Proceedings of the 17th ACM Symposium on the Theory of Computing STOC, pages 291--304, Providence, Rhode Island, U.S.A., 1985. ACM Press.

248.   Doc     Context   474   Aha, D.W., D. Kibler & M.K. Albert (1991), Instance-Based Learning Algorithms, Machine Learning, 6, pp. 37-66.

249.   Doc     Context   474   [31] S. Osher and J. Sethian. Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi equations. Jour. Comp. Phys, 79:12--49, 1988.

250.   Doc     Context   473   [19] G.K. Wallace, "The JPEG still picture compression standard ", Commun. ACM, vol. 34, no. 4, pp. 30-44, 1991.

251.   Book   Context   471   [23] R. Milner, A Calculus of Communicating Systems, LNCS 94, Springer Verlag, 1980.

252.   Doc     Context   471   [25] R. Elmasri and S. Navathe. Fundamentals of Database Systems. Benjamin Cummings, 1994.

253.   Doc     Context   471   Smith, R.G. (1980). The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver. IEEE Transactions on Computers, C-29(12):1104-1113.

254.   Doc     Context   471   [Mac] I. G. Macdonald, Symmetric Functions and Hall Polynomials (2nd Edition) Oxford Univ. Press, 1995.

255.   Doc     Context   470   Freund, Y. & R.E. Schapire (1996), Experiments with a New Boosting Algorithm, in Proceedings of the Thirteenth International Conference on Machine Learning, pp. 148156, Morgan Kaufmann.

256.   Book   Context   470   [9] C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NY, 1982.

257.   Doc     Context   469   Turk, M. & Pentland, A. (1991). Eigenfaces for recognition. Journal of Cognitive Neuroscience, 3, 71-86.

258.   Doc     Context   468   [6] R.A. Brooks. Intelligence without Representation. Artificial Intelligence, Vol.47, 1991, pp.139-159.

259.   Book   Context   468   [Boo91] Grady Booch. Object Oriented Design with Applications. Benjamin/Cummings, 1991.

260.   Doc     Context   468   [16] Y. Saad. Iterative Methods for Sparse Linear Systems. PWS publishing, New York, 1996.

261.   Doc     Context   467   [13] H. Edelsbrunner. Algorithms in Combinatorial Geometry. SpringerVerlag, 1987.

262.   Doc     Context   466   [55] Daniel Lenoski, James Laudon, Kourosh Gharachorloo, Wolf-Dietrich Weber, Anoop Gupta, John Hennessy, Mark Horowitz, and Monica Lam. The Stanford Dash Multiprocessor. IEEE Computer, 25(3):63--79, March 1992.

263.   Doc     Context   466   [1] Birrell A. and Nelson P. Implementing remote procedure calls. ACM Transactions on Computer Systems, 2(1), February 1984.

264.   Doc     Context   466   [ BS 85 ] R. J. Brachman and J. G. Schmolze, "An overview of the KL-ONE knowledge representation system", Cognitive Science, Vol. 9, No. 2, 1985, pp. 171-216.

265.   Doc     Context   464   [5] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.

266.   Book   Context   463   G. Farin, Curves and surfaces for computer aided geometric design, Academic Press, 1990.

267.   Doc     Context   463   [1] J. L. Barron, D. J. Fleet, S. S. Beauchemin, and T. A. Burkitt. Performance of optical flow techniques. CVPR, 1992.

268.   Doc     Context   461   [5] S. Floyd and K. Fall. Promoting the use of endto -end congestion control in the internet. Under submission, February 1998. http://wwwnrg. ee.lbl.gov/floyd/papers.html/end2end-paper.html.

269.   Doc     Context   460   [16] Michael Wolf and Monica Lam. A Data Locality Optimizing Algorithm. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, volume 26(6), pages 30--44, June 1991.

270.   Book   Context   459   [23] F. Harary, Graph Theory, Addison-Wesley, 1969.

271.   Book   Context   459   Fayyad, U., Piatetsky-Shapiro, G., Smyth, P., and Uthurusamy, R., editors (1996). Advances in Knowledge Discovery and Data Mining. MIT Press, Cambridge, MA.

272.   Doc     Context   457   [12] J. Ferrante, K. J. Ottenstein, and J. D. Warren, "The program dependence graph and its use in optimization," ACM Transactions on Programming Languages and Systems, vol. 9, pp. 319--349, July 1987.

273.   Doc     Context   457   Schwarz, G. (1978), Estimating the dimension of a model, The Annals of Statistics, 6, 461--464.

274.   Doc     Context   455   [Bil86] P. Billingsley. Probability and Measure. Wiley, New York, second edition, 1986.

275.   Book   Context   455   [19] A. Papoulis. Probability, Random Variables, and Stochastic Processes, Third Edition. McGraw-Hill, New York, 1991.

276.   Doc     Context   455   [8] Koza, John R. Genetic Programming. MIT Press, 1992.

277.   Book   Context   455   [4] William Press. Numerical Recipes in C, pages 665-- 666. Cambridge, 1988.

278.   Doc     Context   454   [23] J.W. Klop. Term rewriting systems. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1--116. Oxford University Press, New York, 1992.

279.   Doc     Context   454   Rumelhart, D. E. and J. L. McClelland, editors. 1986. Parallel Distributed Processing.

280.   Doc     Context   453   [Rei87] R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32:57--95, 1987. Reprinted in in Readings in Nonmonotonic Reasoning, M. L. Ginsberg (ed.), Morgan Kaufman, San Francisco, CA. 1987, pp. 352--371.

281.   Doc     Context   453   Lucas, B. D. and Kanade, T. (1981). An iterative image registration technique with an application to stereo vision, Proceedings of the 7th International Joint Conference on Artificial Intelligence, Vancouver, pp. 674--679.

282.   Doc     Context   451   [10]T. Finin et.al.: "KQML as an Agent Communication Language ", 3rd International Conference on Information and Knowledge Management (CIKM94), ACM Press, December 1994

283.   Doc     Context   450   [13] K. Gharachorloo, D. Lenoski, and et al. Memory Consistency and Event Ordering in Scalable Shared-memory Multiprocessors. In 17th International Symposium on Computer Architecture, pages 15--26, May 1990.

284.   Doc     Context   450   Jordan, M. I., & Jacobs, R. A. (1994). Hierarchical mixtures of experts and the EM algorithm. Neural Computation, 6, 181-214.

285.   Doc     Context   450   [4] S. Boyd, L. E. Ghaoui, E. Feron and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, (SIAM, Philadelphia, 1994).

286.   Doc     Context   450   Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of english: The penn treebank. Computational Linguistics, 19:313--330.

287.   Doc     Context   450   [15] K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.

288.   Doc     Context   450   [5] Serge Abiteboul, Dallan Quass, Jason McHugh, Jennifer Widom, and Janet L. Weiner. The lorel query language for semistructured data. In Journal of Digital Libraries, volume 1:1, 1997. To appear. See http://www-db.stanford.edu/pub/papers/.

289.   Doc     Context   448   Brooks, R. A. (1991), Intelligence Without Reason, in `Proceedings, IJCAI-91', Sydney, Australia.

290.   Doc     Context   448   [6] W. J. Dally and C. L. Seitz. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks. IEEE Transactions on Computers, pages 547--553, May 1987.

291.   Book   Context   447   [1] A. Aho, J.E. Hopcroft, and J.D. Ullman. Data structures and algorithms. Addison-Wesley, Reading, Mass., 1983.

292.   Doc     Context   447   [McC80] J. McCarthy. Circumscription -- a form of non-monotonic reasoning. Journal of Artificial Intelligence, 13:27--39, 1980.

293.   Doc     Context   447   [46] Y. Shoham. Agent-oriented programming. Artificial Intelligence, 60:51--92, 1993.

294.   Doc     Context   447   Wiederhold, G. 1992. Mediators in the architecture of future information systems. IEEE Computer 25, 3 (March), 38--49.

295.   Book   Context   446   [4] A. Blake and A. Zisserman. Visual Reconstruction. The MIT Press, Cambridge, Massachusetts, 1987.

296.   Doc     Context   445   [35] E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.

297.   Doc     Context   443   [19] G. Holzmann. The Design and Validation of Computer Protocols. Prentice Hall, 1991.

298.   Doc     Context   443   Bell AJ, Sejnowski TJ (1995) "An information-maximization approach to blind separation and blind deconvolution," Neural Computation, 7: 1129-1159.

299.   Doc     Context   442   [3] David Chapman. Planning for conjunctive goals. Artificial Intelligence, 32, 1987.

300.   Doc     Context   441   [1] Tsai, R, "A Versatile Camera Calibration Technique for High Accuracy 3D Machine Vision Metrology Using Off the Shelf TV Cameras and Lenses", IBM Research Report, RC 11413, 1985.

301.   Doc     Context   441   G. Wahba, Spline Models for Observational Data, CBSM-NSF Regional Conf. Ser. Appl. Math. 59 (SIAM, Philadelphia, 1990).

302.   Doc     Context   440   [Berry and Gonthier, 1992] G. Berry and G. Gonthier. The Esterel synchronous programming language: Design, semantics, implementation. Science Of Computer Programming, 19(2):87--152, 1992.

303.   Doc     Context   440   [1] D. Bertsekas and R. Gallager. Data Networks. Prentice-Hall, 1987.

304.   Doc     Context   440   Davis, M., Putnam, H. (1960) A computing procedure for quantification theory. Journal of the ACM, 7, 201--215.

305.   Doc     Context   439   17. S. Deering and D. Cheriton, "Multicast routing in datagram inter-networks and extended lans," ACM Transactions on Computer Systems, vol. 8, pp. 85--110, May 1990.

306.   Doc     Context   438   [6] Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119--139, August 1997.

307.   Doc     Context   438   [1] D. Clark, S. Shenker, and L. Zhang, "Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism," In Proceedings of ACM SIGCOMM 1992, pp. 14-26.

308.   Doc     Context   438   [12] N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373--395.

309.   Doc     Context   437   [VC71] V. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264--280, 1971.

310.   Doc     Context   437   [12] W. E. Lorensen and H. E. Cline. Marching cubes: A high resolution 3D surface construction algorithm. Computer Graphics (SIGGRAPH '87 Proceedings), volume 21, pages 163--169, July 1987.

311.   Doc     Context   437   [12] F. P. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49, 1998.

312.   Doc     Context   437   [11] L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate," IEEE Trans. on Inf. Theory, pp. 284-287, March 1974.

313.   Book   Context   437   [1] James O. Berger. Statistical Decision Theory and Bayesian Analysis. Springer-Verlag, second edition, 1985.

314.   Book   Context   436   [36] A. V. Oppenheim and R. W. Schafer, Discrete-time signal processing. Prentice Hall, 1989.

315.   Doc     Context   434   [BEH] A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, "Learnability and the Vapnik Chervonenkis Dimension," Journal of the ACM (October 1989).

316.   Doc     Context   431   Allen, J. F. (1984). Towards a general theory of action and time, Artificial Intelligence 23: 123--154.

317.   Doc     Context   431   [39] Norman P. Jouppi. Improving Direct-Mapped Cache Performance by the Addition of a Small Fully-Associative Cache and Prefetch Buffers. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 364--373. IEEE, June 1990.

318.   Doc     Context   431   [28] W. R. Gilks, S. Richardson, and D. J. Spiegelhalter, editors. Markov Chain Monte Carlo in Practice. Interdisciplinary Statistics Series. Chapman & Hall, 1996.

319.   Book   Context   429   17. L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.

320.   Doc     Context   429   [9] S. Goldwasser, S. Micali, R. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack. SIAM J. Comp. 17(2):281--308, 1988.

321.   Book   Context   429   6. R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, Massachusetts, 1989.

322.   Doc     Context   428   [Accetta et al. 86] Mike Accetta, Robert Baron, William Bolosky, David Golub, Richard Rashid, Avadis Tavanian, and Michael Young, Mach: A New Kernel Foundation for Unix Development, USENIX 1986 Summer Conference Proceedings. USENIX Association, June 1986.

323.   Doc     Context   427   [4] G. H. Hardy, E. M. Wright, An introduction to the theory of numbers, Clarendon press, Oxford, 1980.

324.   Book   Context   427   [1] K. R. Apt, H. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 89--148. Morgan Kaufmann, Los Altos, Ca., 1988.

325.   Doc     Context   426   McCullagh, P. and Nelder, J. (1989). Generalized Linear Models. Chapman and Hall, London.

326.   Doc     Context   426   [13] Gerard Salton. Automatic text processing: the transformation, analysis, and retrieval of information by computer. Addison Wesley, 1989.

327.   Doc     Context   426   [CFSD90] J.D. Case, M. Fedor, M.L. Schoffstall, and C. Davin. Simple Network Management Protocol (SNMP), May 1990. RFC 1157.

328.   Book   Context   426   [12] B. N. Parlett. The Symmetric Eigenvalue Problem. Prentice-Hall, Inc., Englewood Cliffs, N. J., 1980.

329.   Doc     Context   425   15. Salton, G., and Buckley, C., "Term-Weighting Approaches in Automatic Text Retrieval, " Information Processing &Management, 24(5), pp. 513-523, 1988.

330.   Doc     Context   425   [1] A. Antonini, M. Barlaud, P. Mathieu and I. Daubechies, "Image coding using wavelet transform", IEEE Trans. on Image Processing, vol. 1., 1992.

331.   Doc     Context   425   [1] P.J. Burt, E.H. Adelson, "The Laplacian Pyramid as a Compact Image Code," IEEE Trans. on Communications, pp. 532--540, April 1983.

332.   Doc     Context   424   Angluin, D. 1988. Queries and concept learning.

333.   Doc     Context   424   [22] J.C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, 1991.

334.   Doc     Context   424   [6] E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen. LAPACK Users' Guide, Second Edition. SIAM, Philadelphia, PA, 1995.

335.   Book   Context   423   [10] C. J. Date. An Introduction to Database Systems, Vol. II. Addison-Wesley, Reading, Massachusetts, 1987.

336.   Doc     Context   421   [BSS91] K. Birman, A. Schiper, and P. Stephenson. Lightweight causal and atomic group multicast. ACM Transactions on Computer Systems, 9(3):272--314, August 1991.

337.   Doc     Context   420   [14] B. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs, Bell Systems Technical J., 49:291--307, 1970.

338.   Doc     Context   420   [20] W. Willinger, M. Taqqu, R. Sherman, and D. Wilson. Self-similarity through highvariability: statistical analysis of Ethernet LAN traffic at the source level. In ACM Sigcomm '95, pages 100--113, 1995.

339.   Doc     Context   418   [1] D. R. Engler, M. F. Kaashoek, and J. O'Toole Jr. Exokernel: an operating system architecture for application-specif ic resource management. In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles, December 1995.

340.   Doc     Context   417   [Boe81] B. W. Boehm. Constructive cost model. Software Engineering Economics, 1981.

341.   Book   Context   417   Abelson, H., Sussman, G. J., and Sussman, J. 1985. Structure and Interpretation of Computer Programs. MIT Press, Cambridge, Mass.

342.   Doc     Context   415   Axelrod, R. (1984), The Evolution of Cooperation, Basic Books, NY.

343.   Doc     Context   414   [14]<F3.738e+05> C. M. Fiduccia and R. M.<F3.833e+05> Mattheyses,<F3.839e+05> A linear time heuristic for improving network partitions,<F3.833e+05> in Proc. 19th IEEE Design Automation Conference, IEEE, Las Vegas, NV, 1982, pp. 175--181.

344.   Doc     Context   414   [15] R. I. Hartley and A. Zisserman. Multiple View Geometry in Computer Vision. Cambridge University Press, 1998. (to appear) .

345.   Doc     Context   413   [Postel 81a] Postel, J., "Internet Protocol", RFC791, September 1981

346.   Doc     Context   412   [10] J. L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, New Jersey: Prentice-Hall, 1981.

347.   Doc     Context   412   [3] J. Besag. The statistical analysis of dirty picture. J. Royal Statist. Soc. Ser. B, 48(1):259-- 302, 1986.

348.   Doc     Context   411   [NEED78] Needham, R. M., and Schroeder, M. D. "Using encryption for authentication in large networks of computers". Commun. ACM 21, 12 (Dec. 1978), pp. 993-999

349.   Doc     Context   411   [6] M. A. Fischler and R. C. Bolles. Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Comm. Assoc. Comp. Mach., 24(6):381--395, 1981.

350.   Book   Context   411   19. Reed M. and Simon B.: Methods of Modern Mathematical Physics. IV: Analysis of Operators. Academic Press New York, San Francisco, London 1978.

351.   Book   Context   411   [1] R. M. Haralick, L. G. Shapiro, "Computer and Robot Vision ", Vol. 1, Addison-Wesley, 1992.

352.   Doc     Context   410   [AGM + 90] S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman. A basic local alignment search tool. Journal of Molecular Biology, 1990.

353.   Book   Context   410   [10] G. Kiczales, J. des Rivieres, and D. G. Bobrow. The Art of the Metaobject Protocol. MIT Press, 1991.

354.   Doc     Context   410   [16] J. H. Saltzer, D. P. Reed, and D. D. Clark. End-to-end arguments in system design. ACM Transactions on Computer Systems, pages 277288, 1984.

355.   Doc     Context   408   [Gol67] E. M. Gold. Language identification in the limit. Information and Control, 10:447--474, 1967.

356.   Doc     Context   408   [Rissanen 78] Rissanen, J. Modeling by shortest data description. Automatica, 14:465--471, 1978.

357.   Doc     Context   408   [14] Fujimoto, R. M. Parallel discrete event simulation. Commun. ACM 33, 10 (1990), 30--53.

358.   Doc     Context   406   [Chu40] Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56--68, 1940.

359.   Book   Context   405   5. Snir, M., Otto, S. W., Huss-Lederman, S., Walker, D. W., Dongarra, J.J., MPI: The Complete Reference, The MIT Press, 1996. (4) ) log 0167 . 0 ( log 94 . 55 m n n t + =

360.   Doc     Context   403   [19] J. Rissanen. Stochastic Complexity in Statistical Inquiry. World Scientific Publishing Company, 1989.

361.   Doc     Context   403   [4] B'ela Bollob'as, Random Graphs (Academic Press, 1985).

362.   Doc     Context   403   [54] Parnas, D. L. On the criteria to be used in decomposing systems into modules. Communications of the ACM (December 1972), 1053--1058.

363.   Book   Context   402   [RM86] D. E. Rumelhart and J. L. McClelland. Parallel Distributed Processing: Explorations in the Microstructure of Cognition, volume 1-3. MIT Press, 1986.

364.   Doc     Context   401   [12] N.J. Nilsson. Principles of Artificial Intelligence. Tioga, Palo Alto, 1980.

365.   Doc     Context   400   [34] Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck, "Efficiently Computing Static Single Assignment Form and the Control Dependence Graph," in ACM Transactions on Programming Languages and Systems. ACM, October 1991.

366.   Doc     Context   400   [19] C. Tomasi and T. Kanade, "Shape and motion from image streams under orthography: a factorization method," International Journal of Computer Vision, 9(2):137-154, 1992.

367.   Doc     Context   398   [16] Stephen Kent and Randall Atkinson. Security Architecture for the Internet Protocol. In Internet Draft (work in progress), 1998.

368.   Doc     Context   398   [1] C.J.C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2):955-974, 1998.

369.   Doc     Context   398   [32] W. Hackbusch, editor. Multigrid Methods and Applications. Springer-Verlag, Berlin, 1985.

370.   Doc     Context   397   Hastie, T., Tibshirani, R. (1990): Generalized additive models. Chapman and Hall, London.

371.   Doc     Context   397   [5] Faugeras, O., D., What can be seen in three dimensions with an uncalibrated stereo rig?, ECCV'92, Lecture notes in Computer Science, Vol 588. Ed. G. Sandini, Springer-Verlag, 1992, pp. 563-578.

372.   Doc     Context   396   [3] F. Brezzi and M. Fortin, Mixed and Hybrid Finite Element Methods, vol. 15 of Springer Series in Computational Mathematics, Springer-Verlag, New York, 1991.

373.   Doc     Context   396   [15] J. Fisher, "Trace Scheduling: A Technique for Global Microcode Compaction," IEEE Trans. on Computers, Vol. 30, No. 7, pp. 478-490, Jul. 1981.

374.   Doc     Context   396   [3] Balakrishnan, Hari, et.al., A comparison of mechanisms for improving TCP performance over wireless links, In Proc. SIGCOMM'96, August 1996.

375.   Doc     Context   395   [39] Ben Zhao, John Kubiatowicz, and Anthony Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley, April 2001. 55

376.   Doc     Context   395   (Gamma et al. 1995) Gamma E., Helm R., Johnson R. Vlissides J. Design patterns. Addison Wesley.

377.   Doc     Context   394   [7] Marc Levoy and Pat Hanrahan. Light field rendering. In Proceedings of SIGGRAPH '96 (to appear), 1996.

378.   Doc     Context   394   [13] T. Bolognesi and E. Brinksma, "Introduction to the ISO specification language LOTOS," in The Formal Description Technique LOTOS, P. H. J. van Eijk, C. A. Vissers, and M. Diaz, Eds., pp. 23--73. Elsevier Science Publishers North-Holland, 1989.

379.   Doc     Context   394   [5] Chandra T.D. and Toueg S., Unreliable failure detectors for reliable distributed systems. Journal of the ACM , 43(2), pp:225--267, (March 1996).

380.   Book   Context   393   [3] F. Buschmann, R. Meunier, H. Rohnert, P. Sommerlad, and M. Stal, Pattern-Oriented Software Architecture - A System of Patterns. Wiley and Sons, 1996.

381.   Doc     Context   393   [Cooper and Herskovits, 1992] Cooper, G. and Herskovits, E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309--347.

382.   Doc     Context   393   [FiSh86] A.Fiat, A.Shamir, "How to prove yourself: Practical solutions to identification and signature problems", Advances in Cryptology: Proc. Crypto'86, Lecture Notes in Computer Science 263, Springer, (1987), pp. 186 -- 194.

383.   Doc     Context   392   [26] John Moody and Christian J. Darken. Fast learning in networks of locally-tuned processing units. Neural Computation, pages 281--294, 1989.

384.   Doc     Context   392   12. VanRijsbergen, C. J. Information Retrieval. London: Butterworths, 1979.

385.   Doc     Context   392   [6] B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proc. of the 10th National Conference on Artificial Intelligence (AAAI-92), pages 440--446, San Jose, CA, USA, 1992.

386.   Doc     Context   391   [24] R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146--160, 1972.

387.   Doc     Context   391   [4] C. K. Chui. An Introduction to Wavelets. Academic Press, 1992.

388.   Doc     Context   391   [Hop96] H. Hoppe. Progressive meshes. In Computer Graphics Proceedings, Annual Conference Series, 1996 (ACM SIGGRAPH '96 Proceedings) , pages 99--108, 1996.

389.   Doc     Context   390   [11] John B. Carter, John K. Bennett, and Willy Zwaenepoel. Implementation and Performance of MUNIN. In Proceedings of the 13th ACM Symposium on Operating Systems Principles, pages 152--164, October 1991.

390.   Doc     Context   390   [34] P. Maes. Agents that reduce work and information overload. Communications of the ACM, 37(7):30--40, July 1994.

391.   Doc     Context   389   [2] R. E. Bellman. Dynamic Programming. Princeton University Press, Princeton, NJ, 1957.

392.   Doc     Context   388   Levy, A. Y.; Rajaraman, A.; and Ordille, J. 1996. Querying heterogeneous information sources using source descriptions.

393.   Book   Context   388   [28] R. Milner. Communication and Concurrency. Prentice Hall International, 1989.

394.   Doc     Context   386   [11] M.X. GOEMANS and D.P. WILLIAMSON. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of Association for Computing Machinery, 42(6):1115--1145, 1995.

395.   Doc     Context   384   1. F. Barbanera, M. Bugliesi, M. Dezani-Ciancaglini, and V. Sassone. A Calculus of Bounded Capacities. In ASIAN'03, Eighth Asian Computing Science Conference, number xxxx in Lecture Notes in Computer Science, pages xx--xx, 2003. To Appear.

396.   Doc     Context   384   [10] A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, Jan. 2001. http://www.research.microsoft.com/ antr/PAST/.

397.   Doc     Context   384   [SAC + 79] P. G. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, and T. Price. Access path selection in a relational database management system. In Proc. ACM-SIGMOD Intl. Conf. Management of Data, pages 22--34, Boston, June 1979.

398.   Book   Context   384   [7] C. Koelbel, D. Loveman, R. Schreiber, G. Steele, Jr., and M. Zosel. The High Performance Fortran Handbook. The MIT Press, Cambridge, MA, 1994.

399.   Book   Context   384   [7] John F. Sowa. Conceptual Structures: Information Processing in Mind and Machine. The System Programming Series. Addison-Wesley Publishing Company, 1984.

400.   Doc     Context   383   [4] L. Cardelli and A. D. Gordon. Mobile ambients. In Maurice Nivat, editor, Proc. FOSSACS'98, International Conference on Foundations of Software Science and Computation Structures, volume 1378 of Lecture Notes in Computer Science, pages 140--155. Springer-Verlag, 1998.

Next 200     Previous 200

CiteSeer.Continuity homepage

CiteSeer.Continuity - Copyright NEC and IST