Richard R. Muntz

Affiliations: 
Computer Science University of California, Los Angeles, Los Angeles, CA 
Area:
distributed and parallel database systems; temporal data models and query processing; knowledge discovery in database systems; computer performance evaluation
Google:
"Richard Muntz"

Children

Sign in to add trainee
Edmundo A. de Souza e Silva grad student
Leana Golubchik grad student
Du Li grad student 2000 UCLA
Wai-Man R. Wong grad student 2000 UCLA
Paul C. Castro grad student 2001 UCLA
Jeonghee Yi grad student 2001 UCLA
Jun Li grad student 2002 UCLA
Murali Mani grad student 2003 UCLA
Scott A. Friedman grad student 2004 UCLA
Zhenghao Wang grad student 2004 UCLA
Yun Chi grad student 2005 UCLA
Cheng-Jia Lai grad student 2005 UCLA
Yi Xia grad student 2005 UCLA
Alvin Y. Chen grad student 2007 UCLA
Venkatraman Ramakrishna grad student 2008 UCLA
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

De Souza E Silva E, Leão RMM, Muntz RR. (2011) Performance evaluation with hidden Markov models Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6821: 112-128
Lindenmayer DB, Wood JT, MacGregor C, et al. (2008) How predictable are reptile responses to wildfire? Oikos. 117: 1086-1097
Casale G, Muntz RR, Serazzi G. (2008) Geometric bounds: A noniterative analysis technique for closed queueing networks Ieee Transactions On Computers. 57: 780-794
Chen A, Muntz RR. (2006) Peer clustering: A hybrid approach to distributed virtual environments Proceedings of 5th Acm Sigcomm Workshop On Network and System Support For Games, Netgames '06
E Silva EDS, Da Silva APC, Antonio AA, et al. (2006) Modeling, analysis, measurement and experimentation with the Tangram-II integrated environment Acm International Conference Proceeding Series. 180
Lai CJ, Muntz RR. (2006) Tunnel vector: A new routing algorithm with scalability Proceedings - Ieee Infocom
Chi Y, Wang H, Yu PS, et al. (2006) Catch the moment: Maintaining closed frequent itemsets over a data stream sliding window Knowledge and Information Systems. 10: 265-294
Casale G, Muntz RR, Serazzi G. (2006) A new class of non-iterative bounds for closed queueing networks Proceedings - Ieee Computer Society's Annual International Symposium On Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, Mascots. 69-76
Chi Y, Xia Y, Yang Y, et al. (2005) Mining closed and maximal frequent subtrees from databases of labeled rooted trees Ieee Transactions On Knowledge and Data Engineering. 17: 190-202
Chi Y, Yang Y, Muntz RR. (2005) Canonical forms for labelled trees and their applications in frequent subtree mining Knowledge and Information Systems. 8: 203-234
See more...