I want to start by congratulating Professors Chandrasekaran, Parrilo and Willsky for this fine piece of work. Their paper, hereafter referred to as CPW, addresses one of the biggest practical challenges of Gaussian graphical models—how to make inferences for a graphical model in the presence of missing variables. The difficulty comes from the fact that the validity of conditional independence r...

We present and use a CPU-efficient activity-based simulation model to calculate the sojourn time of a packet and the packet loss rate in a tandem queueing network that depicts the path of a video flow. The video flow is characterized by a packet trace. Background traffic, also characterized by a trace, is allowed in the tandem queueing network. In our analysis we used real video traces (Telepre...

The success of many machine learning and pattern recognition methods relies heavily upon the identification of an appropriate distance metric on the input data. It is often beneficial to learn such a metric from the input training data, instead of using a default one such as the Euclidean distance. In this work, we propose a boosting-based technique, termed BOOSTMETRIC, for learning a quadratic...

Statistical conditional optimization criteria lead to the development of an iterative algorithm that starts from the matched filter (or constraint vector) and generates a sequence of filters that converges to the minimum-variance-distortionless-response (MVDR) solution for any positive definite input autocorrelation matrix. Computationally, the algorithm is a simple, noninvasive, recursive proc...

I want to start by congratulating Professors Chandrasekaran, Parrilo and Willsky for this fine piece of work. Their paper, hereafter referred to as CPW, addresses one of the biggest practical challenges of Gaussian graphical models—how to make inferences for a graphical model in the presence of missing variables. The difficulty comes from the fact that the validity of conditional independence r...

This paper presents a semantics for non-deterministic concurrent constraint programming languages. The semantics address the issues of giving an adequate treatment of non-terminating computations, in particular with fairness and liveness, and giving a compositional semantics, where the meaning of a recursively deened program is obtained as a xpoint. We present a simple concurrent constraint pro...

This paper presents a low-power bit-serial Viterbi decoder chip with the coding rate r = 1=3 and the constraint length K = 9 (256 states). This chip has been implemented using 0.5 m three-layer metal CMOS technology and is targeted for high speed convolutional decoding for next generation wireless applications such as wide-band CDMA mobile systems and wireless ATM LANs. The chip is expected to ...

We obtain the solutions and explicitly calculate the energy for a class of two-spin semiclassical string states in the Lunin-Maldacena background. These configurations are the β-deformed versions of the folded string solutions in AdS5 × S background. They correspond to certain single trace operators in the N = 1 superconformal β deformation of N = 4 Yang-Mills. We calculate the one loop anomalo...

Missing trace reconstruction is a challenge in seismic processing due to incomplete and irregular acquisition. Noise is a concern, due to the many sources of noise that occur during seismic acquisition. Most of the recent research on denoising and interpolation focuses on transform domain approaches using L1 norm minimization. A specific kind of constraint, called the synthesis approach, is wid...

This paper addresses the problem of designing a submodule of a given system of communicating timed I/O automata. The problem may be formulated mathematically by the equation (C||X)rA under the constraint IX=In, where C represents the specification of the known part of the system, called the context, A represents the specification of the whole system, X represents the specification of the submod...