PROTEIN SECONDARY STRUCTURE PREDICTION WITH HYDROPHOBICITY AND HYDROPHOBIC MOMENT (2008)
Tzu-cheng Chuang, Saul B. Gelfand, Okan K. Ersoy
Protein secondary structure prediction has been satisfactorily performed by machine learning techniques such as support vector machines (SVM’s). We discuss a special technique to include...
Saul B. Gelfand, Sanjoy K. Mitter
Discrete Markov random fields (MRF's) defined on a finite lattice have seen significant application as stochastic models for images [1], [2]. There are two fundamental problems associated with...
On Sampling Methods and Annealing Algorithms (2007)
Gelfand, Saul B., Mitter, Sanjoy K.
Discrete Markov random fields (MRF's) defined on a finite lattice have seen significant application as stochastic models for images [1], [2]. There are two fundamental problems associated with image...
Metropolis-type Annealing Algorithms for Global Optimization in IRd (2007)
Gelfand, Saul B., Mitter, Sanjoy K.
We establish the convergence of a class of Metropolis-type Markov chain annealing algorithms for global optimization of a smooth function U(.) on IRd. No prior information is assumed as to what...
Simulated Annealing Type Algorithms for Multivariate Optimization (2007)
Gelfand, Saul B., Mitter, Sanjoy K.
We study the convergence of a class of discrete-time continuous-state stimulated annealing type algorithms for multivariate optimization. The general algorithm that we consider is of the form Xk+1=...
Doerschuk, Peter C., Gelfand, Saul B., Yin, Zhye
Cryo electron microscopy is a measurement modality which provides images from which 3-D reconstructions of biological particles such as viruses can be estimated. When the specimen is composed of...
Coding Across Multicodes and Time in CDMA Systems Employing MMSE Multiuser Detector (2004)
Jeongsoon Park, Jong-Han Lim, Saul B. Gelfand
When combining a multicode CDMA system with convolutional coding, two methods have been considered in the literature. In one method, coding is across time in each multicode channel while in the other...
Analysis of Simulated Annealing for Optimization. (2002)
Gelfand,Saul B., Mitter,Sanjoy K.
Simulated annealing is a popular Monte Carlo algorithm for combinatorial optimization. The annealing algorithm simulates a nonstationary finite state Markov chain whose state space is the domain of...
Analysis of Simulated Annealing Type Algorithms. (1998)
Gelfand, Saul B., Mitter, Sanjoy K.
THE ANNEALING ALGORITHM IS A POPULAR Monte-Carlo algorithm for combinatorial optimization. The annealing algorithm consists of simulating a nonstationary finite state Markov chain whose state space...
Analysis of simulated annealing type algorithms (1987)
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.
Analysis of simulated annealing type algorithms (1987)
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.
A nonparametric multiclass partitioning method for classification /--by Saul Brian Gelfand. (1982)
Supervised by Sanjoy K. Mitter.