@conference {17564,
	title = {Approximation algorithms for throughput maximization in wireless networks with delay constraints},
	booktitle = {2011 Proceedings IEEE INFOCOM},
	year = {2011},
	month = {2011/04/10/15},
	pages = {1116 - 1124},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention starting with the work of Grossglauser and Tse (2002), and it has been shown that there is a significant tradeoff between the end-to-end delays and the total achievable rate. We develop algorithms to compute such tradeoffs with provable performance guarantees for arbitrary instances, with general interference models. Given a target delay-bound Δ(c) for each session c, our algorithm gives a stable flow vector with a total throughput within a factor of O (logΔm/log log Δm) of the maximum, so that the per-session (end-to-end) delay is O ((logΔm/log log Δm Δ(c))2), where Δm = maxc{Δ(c)}; note that these bounds depend only on the delays, and not on the network size, and this is the first such result, to our knowledge.},
	keywords = {Approximation algorithms, Approximation methods, approximation theory, Delay, delay constraints, delays, general interference model, Interference, multihop wireless networks, optimisation, Optimized production technology, radio networks, radiofrequency interference, target delay bound, Throughput, throughput maximization, Wireless networks},
	isbn = {978-1-4244-9919-9},
	doi = {10.1109/INFCOM.2011.5934887},
	author = {Guanhong Pei and Anil Kumar,V. S and Parthasarathy,S. and Srinivasan, Aravind}
}
@conference {12447,
	title = {Component-based restoration of speckled images},
	booktitle = {2011 18th IEEE International Conference on Image Processing (ICIP)},
	year = {2011},
	month = {2011/09/11/14},
	pages = {2797 - 2800},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Many coherent imaging modalities are often characterized by a multiplicative noise, known as speckle which often makes the interpretation of data difficult. In this paper, we present a speckle reduction algorithm based on separating the structure and texture components of SAR images. An iterative algorithm based on surrogate functionals is presented that solves the component optimization formulation. Experiments indicate this proposed method performs favorably compared to state-of-the-art speckle reduction methods.},
	keywords = {coherent imaging modalities, component optimization formulation, component-based restoration, Dictionaries, image restoration, iterative algorithm, iterative methods, multiplicative noise, NOISE, optimisation, radar imaging, SAR images, Speckle, speckle reduction algorithm, speckled images, structure components, surrogate functionals, synthetic aperture radar, texture components, transforms, TV},
	isbn = {978-1-4577-1304-0},
	doi = {10.1109/ICIP.2011.6116252},
	author = {Patel, Vishal M. and Easley,G. R and Chellapa, Rama}
}
@conference {13383,
	title = {Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems},
	booktitle = {2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS)},
	year = {2011},
	month = {2011/10/22/25},
	pages = {797 - 806},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We study the stochastic versions of a broad class of combinatorial problems where the weights of the elements in the input dataset are uncertain. The class of problems that we study includes shortest paths, minimum weight spanning trees, and minimum weight matchings over probabilistic graphs, and other combinatorial problems like knapsack. We observe that the expected value is inadequate in capturing different types of risk averse or risk-prone behaviors, and instead we consider a more general objective which is to maximize the expected utility of the solution for some given utility function, rather than the expected weight (expected weight becomes a special case). We show that we can obtain a polynomial time approximation algorithm with additive error ϵ for any ϵ >; 0, if there is a pseudopolynomial time algorithm for the exact version of the problem (This is true for the problems mentioned above) and the maximum value of the utility function is bounded by a constant. Our result generalizes several prior results on stochastic shortest path, stochastic spanning tree, and stochastic knapsack. Our algorithm for utility maximization makes use of the separability of exponential utility and a technique to decompose a general utility function into exponential utility functions, which may be useful in other stochastic optimization problems.},
	keywords = {Approximation algorithms, Approximation methods, combinatorial problems, Fourier series, knapsack problems, optimisation, OPTIMIZATION, polynomial approximation, polynomial time approximation algorithm, Polynomials, Random variables, stochastic combinatorial optimization, stochastic knapsack, stochastic shortest path, stochastic spanning tree, vectors},
	isbn = {978-1-4577-1843-4},
	doi = {10.1109/FOCS.2011.33},
	author = {Li,Jian and Deshpande, Amol}
}
@conference {19285,
	title = {Scalable representation of dataflow graph structures using topological patterns},
	booktitle = {2010 IEEE Workshop on Signal Processing Systems (SIPS)},
	year = {2010},
	month = {2010},
	pages = {13 - 18},
	abstract = {Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interface (GUI) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-scale applications, the underlying graphs often consist of smaller substructures that repeat multiple times. To enable more concise representation and direct analysis of such substructures in the context of high level DSP specification languages and design tools, we develop the modeling concept of topological patterns, and propose ways for supporting this concept in a high-level language. We augment the DIF language - a language for specifying DSP-oriented dataflow graphs - with constructs for supporting topological patterns, and we show how topological patterns can be effective in various aspects of embedded signal processing design flows using specific application examples.},
	keywords = {arrays, data flow graphs, Dataflow graphs, DIF language, Digital signal processing, directed graphs, DSP specification languages, embedded signal processing design flows, embedded systems, Field programmable gate arrays, graphical user interface, Graphical user interfaces, High-level languages, modelbased design, optimisation, optimizations, scalable dataflow graph structures representation, semantics, Signal processing, Signal processing systems, Specification languages, text based languages, Topological patterns, Topology, Transform coding},
	author = {Sane, N. and Kee, Hojin and Seetharaman, G. and Bhattacharyya, Shuvra S.}
}
@article {12464,
	title = {Video Pr{\'e}cis: Highlighting Diverse Aspects of Videos},
	journal = {IEEE Transactions on Multimedia},
	volume = {12},
	year = {2010},
	month = {2010/12//},
	pages = {853 - 868},
	abstract = {Summarizing long unconstrained videos is gaining importance in surveillance, web-based video browsing, and video-archival applications. Summarizing a video requires one to identify key aspects that contain the essence of the video. In this paper, we propose an approach that optimizes two criteria that a video summary should embody. The first criterion, {\textquotedblleft}coverage,{\textquotedblright} requires that the summary be able to represent the original video well. The second criterion, {\textquotedblleft}diversity,{\textquotedblright} requires that the elements of the summary be as distinct from each other as possible. Given a user-specified summary length, we propose a cost function to measure the quality of a summary. The problem of generating a précis is then reduced to a combinatorial optimization problem of minimizing the proposed cost function. We propose an efficient method to solve the optimization problem. We demonstrate through experiments (on KTH data, unconstrained skating video, a surveillance video, and a YouTube home video) that optimizing the proposed criterion results in meaningful video summaries over a wide range of scenarios. Summaries thus generated are then evaluated using both quantitative measures and user studies.},
	keywords = {$K$-means, CAMERAS, combinatorial mathematics, combinatorial optimization, Cost function, data compression, Exemplar selection, Image segmentation, Internet, Iron, Length measurement, multimedia systems, Ncut, optimisation, Optimization methods, original video, Permission, shot segmentation, Surveillance, user specified summary length, video précis, Video sharing, video signal processing, Video summarization},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2010.2058795},
	author = {Shroff, N. and Turaga,P. and Chellapa, Rama}
}
@conference {18669,
	title = {Evaluating Files to Audit for Detecting Intrusions in FileSystem Data},
	year = {2009},
	month = {2009/07//},
	pages = {163 - 170},
	abstract = {Monitoring filesystem data is a common method used to detect intrusions. Once a computer is compromised, an attacker may alter files, add new files or delete existing files. The changes that attackers make may target any part of the filesystem, including metadata along with files (e.g., permissions, ownerships and inodes). The accuracy of detecting an intrusion depends on the data audited: if an intrusion does not manifest in the data, the intrusion will not be detected. Moreover, not all files, which contain filesystem activity, are suitable to detect intrusions, as some may fail to provide useful information. In this paper, we describe an empirical study that focused on filesystem attack activity after a SSH compromise. Three types of attacker action are considered: reconnaissance, password modification, and malware download. For each type of action, we evaluated the files to audit using metrics derived from the field of information theory and estimated with the empirical SSH compromise data.},
	keywords = {authorisation, Bayes methods, Bayesian metric, data auditing, empirical SSH compromise data, Entropy, entropy-based metric, file evaluation, file organisation, filesystem attack activity, filesystem data monitoring, honeypot, information theory, intrusion detection system, invasive software, malware download, meta data, optimisation, optimization problem, password modification, probability, reconnaissance action, unauthorized user},
	doi = {10.1109/NCA.2009.38},
	author = {Molina,J. and Michel Cukier}
}
@conference {13385,
	title = {Minimizing Communication Cost in Distributed Multi-query Processing},
	booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09},
	year = {2009},
	month = {2009/04/29/March},
	pages = {772 - 783},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in the area of distributed query processing and optimization. In this paper we address a general, distributed multi-query processing problem motivated by the need to minimize the communication cost in these environments. Specifically we address the problem of optimally sharing data movement across the communication edges in a distributed communication network given a set of overlapping queries and query plans for them (specifying the operations to be executed). Most of the problem variations of our general problem can be shown to be NP-Hard by a reduction from the Steiner tree problem. However, we show that the problem can be solved optimally if the communication network is a tree, and present a novel algorithm for finding an optimal data movement plan. For general communication networks, we present efficient approximation algorithms for several variations of the problem. Finally, we present an experimental study over synthetic datasets showing both the need for exploiting the sharing of data movement and the effectiveness of our algorithms at finding such plans.},
	keywords = {Approximation algorithms, Communication networks, Computer science, Cost function, Data engineering, distributed communication network, distributed databases, distributed multi-query processing, grid computing, Large-scale systems, NP-hard, optimisation, Polynomials, Publish-subscribe, publish-subscribe systems, Query optimization, Query processing, sensor networks, Steiner tree problem, Tree graphs, trees (mathematics)},
	isbn = {978-1-4244-3422-0},
	doi = {10.1109/ICDE.2009.85},
	author = {Li,Jian and Deshpande, Amol and Khuller, Samir}
}
@conference {19649,
	title = {A Rao-Blackwellized particle filter for EigenTracking},
	booktitle = {Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004},
	volume = {2},
	year = {2004},
	month = {2004/06//},
	pages = {II - 980-II-986 Vol.2},
	abstract = {Subspace representations have been a popular way to model appearance in computer vision. In Jepson and Black{\textquoteright}s influential paper on EigenTracking, they were successfully applied in tracking. For noisy targets, optimization-based algorithms (including EigenTracking) often fail catastrophically after losing track. Particle filters have recently emerged as a robust method for tracking in the presence of multi-modal distributions. To use subspace representations in a particle filter, the number of samples increases exponentially as the state vector includes the subspace coefficients. We introduce an efficient method for using subspace representations in a particle filter by applying Rao-Blackwellization to integrate out the subspace coefficients in the state vector. Fewer samples are needed since part of the posterior over the state vector is analytically calculated. We use probabilistic principal component analysis to obtain analytically tractable integrals. We show experimental results in a scenario in which we track a target in clutter.},
	keywords = {analytically tractable integrals, Computer vision, EigenTracking, Filters, Gaussian processes, modal analysis, multi-modal distributions, NOISE, noisy targets, optimisation, optimization-based algorithms, Particle filters, Particle measurements, Particle tracking, Principal component analysis, probabilistic principal component analysis, Rao-Blackwellized particle filter, Robustness, SHAPE, State estimation, state vector, subspace coefficients, Subspace representations, target tracking, vectors},
	author = {Zia Khan and Balch, T. and Dellaert, F.}
}
@conference {11905,
	title = {Non-parametric expectation maximization: a learning automata approach},
	booktitle = {IEEE International Conference on Systems, Man and Cybernetics, 2003},
	volume = {3},
	year = {2003},
	month = {2003/10//},
	pages = {2996- 3001 vol.3 - 2996- 3001 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The famous expectation maximization technique suffers two major drawbacks. First, the number of components has to be specified apriori. Also, the expectation maximization is sensitive to initialization. In this paper, we present a new stochastic technique for estimating the mixture parameters. Parzen Window is used to estimate a discrete estimate of the PDF of the given data. Stochastic learning automata is then used to select the mixture parameters that minimize the distance between the discrete estimate of the PDF and the estimate of the expectation maximization. The validity of the proposed approach is verified using bivariate simulation data.},
	keywords = {Automatic speech recognition, bivariate simulation data, Computational modeling, Computer vision, Density functional theory, expectation maximization technique, learning automata, mixture parameters estimation, nonparametric expectation maximization, nonparametric statistics, optimisation, parameter estimation, Parzen Window, PDF, probability, probability density function, Speech processing, Speech recognition, stochastic learning automata, Stochastic processes, stochastic technique},
	isbn = {0-7803-7952-7},
	doi = {10.1109/ICSMC.2003.1244347},
	author = {Abd-Almageed, Wael and El-Osery,A. and Smith,C.E.}
}
@article {17667,
	title = {The one-inclusion graph algorithm is near-optimal for the prediction model of learning},
	journal = {IEEE Transactions on Information Theory},
	volume = {47},
	year = {2001},
	month = {2001/03//},
	pages = {1257 - 1261},
	abstract = {Haussler, Littlestone and Warmuth (1994) described a general-purpose algorithm for learning according to the prediction model, and proved an upper bound on the probability that their algorithm makes a mistake in terms of the number of examples seen and the Vapnik-Chervonenkis (VC) dimension of the concept class being learned. We show that their bound is within a factor of 1+o(1) of the best possible such bound for any algorithm},
	keywords = {Computer science, concept class, general-purpose algorithm, graph theory, learning prediction model, learning systems, near-optimal algorithm, Neural networks, one-inclusion graph algorithm, optimisation, Prediction algorithms, prediction theory, Predictive models, probability, Probability distribution, Upper bound, Vapnik-Chervonenkis dimension, Virtual colonoscopy},
	isbn = {0018-9448},
	doi = {10.1109/18.915700},
	author = {Li,Yi and Long,P. M and Srinivasan, Aravind}
}
@conference {17640,
	title = {Optimal design of signaling networks for Internet telephony},
	booktitle = {IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {2},
	year = {2000},
	month = {2000///},
	pages = {707-716 vol.2 - 707-716 vol.2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present an approach for efficient design of a signaling network for a network of software switches supporting Internet telephony. While one may take an integer programming approach to solve this problem, it quickly becomes intractable even for modest-sized networks. Instead, our topology design uses random graphs that we show to be nearly optimal in cost, highly connected, and computationally efficient even for large networks. We then formulate a quadratic assignment problem (QAP) to map the abstract topology into the physical network to achieve optimal load balancing for given demand forecasts, which we solve using randomized heuristics. Numerical results on several example networks illustrate the performance and computational efficiency of our method. A graphical design tool has been developed based on our algorithms},
	keywords = {bandwidth allocation, Computational efficiency, Computer networks, Cost function, Demand forecasting, demand forecasts, graph theory, graphical design tool, Internet telephony, Linear programming, Load forecasting, Load management, Network topology, optimal design, optimal load balancing, optimisation, performance, quadratic assignment problem, random graphs, randomised algorithms, randomized heuristics, Signal design, signaling networks, Switches, telecommunication signalling, topology design},
	isbn = {0-7803-5880-5},
	doi = {10.1109/INFCOM.2000.832245},
	author = {Srinivasan, Aravind and Ramakrishnan,K. G and Kumaran,K. and Aravamudan,M. and Naqvi,S.}
}
@conference {16363,
	title = {Code generation for multiple mappings},
	booktitle = {Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers {\textquoteright}95., Fifth Symposium on the},
	year = {1995},
	month = {1995/02/06/9},
	pages = {332 - 341},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {There has been a great amount of recent work toward unifying iteration reordering transformations. Many of these approaches represent transformations as affine mappings from the original iteration space to a new iteration space. These approaches show a great deal of promise, but they all rely on the ability to generate code that iterates over the points in these new iteration spaces in the appropriate order. This problem has been fairly well-studied in the case where all statements use the same mapping. We have developed an algorithm for the less well-studied case where each statement uses a potentially different mapping. Unlike many other approaches, our algorithm can also generate code from mappings corresponding to loop blocking. We address the important trade-off between reducing control overhead and duplicating code},
	keywords = {code generation, Computer science, Concurrent computing, control overhead, Educational institutions, iteration reordering transformations, Law, Legal factors, loop blocking, multiple mappings, optimisation, optimising compilers, Optimizing compilers, PARALLEL PROCESSING, Performance analysis, program compilers},
	isbn = {0-8186-6965-9},
	doi = {10.1109/FMPC.1995.380437},
	author = {Kelly,W. and Pugh, William and Rosser,E.}
}
@conference {16653,
	title = {Methods for deriving competitive activation mechanisms},
	booktitle = {Neural Networks, 1989. IJCNN., International Joint Conference on},
	year = {1989},
	month = {1989//00/0},
	pages = {357 -363 vol.1 - 357 -363 vol.1},
	abstract = {Inhibitory interactions in connectionist models have traditionally been implemented using inhibitory connections. Recently, an alternative approach based on competitive activation mechanisms has been proposed. To make this alternative approach practical in large and complex models, it is necessary to formulate general methods for creating task-specific competitive activation mechanisms. The author presents two such methods that have been applied successfully: heuristic computer-assisted search and decomposition of global optimization criteria. The usefulness of these two methods is demonstrated through simulations that establish the effectiveness of the competitive activation mechanisms so produced.<<ETX>>},
	keywords = {connectionist models, decomposition, global optimization criteria, heuristic computer-assisted search, neural nets, optimisation, search problems, task-specific competitive activation mechanisms, virtual machines},
	doi = {10.1109/IJCNN.1989.118609},
	author = {Reggia, James A.}
}
