@conference {14208,
	title = {Combining powerful local and global statistics for texture description},
	booktitle = {IEEE Conference on Computer Vision and Pattern Recognition, 2009. CVPR 2009},
	year = {2009},
	month = {2009/06/20/25},
	pages = {573 - 580},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A texture descriptor is proposed, which combines local highly discriminative features with the global statistics of fractal geometry to achieve high descriptive power, but also invariance to geometric and illumination transformations. As local measurements SIFT features are estimated densely at multiple window sizes and discretized. On each of the discretized measurements the fractal dimension is computed to obtain the so-called multifractal spectrum, which is invariant to geometric transformations and illumination changes. Finally to achieve robustness to scale changes, a multi-scale representation of the multifractal spectrum is developed using a framelet system, that is, a redundant tight wavelet frame system. Experiments on classification demonstrate that the descriptor outperforms existing methods on the UIUC as well as the UMD high-resolution dataset.},
	keywords = {Computer science, discretized measurements, fractal geometry, Fractals, geometric transformations, global statistics, Histograms, illumination transformations, image classification, image resolution, Image texture, lighting, local measurements SIFT features, local statistics, MATHEMATICS, multifractal spectrum, multiscale representation, Power engineering and energy, Power engineering computing, Robustness, Solids, Statistics, texture description, UMD high-resolution dataset, wavelet frame system, Wavelet transforms},
	isbn = {978-1-4244-3992-8},
	doi = {10.1109/CVPR.2009.5206741},
	author = {Yong Xu and Si-Bin Huang and Hui Ji and Ferm{\"u}ller, Cornelia}
}
@conference {17609,
	title = {Improved bounds and algorithms for hypergraph two-coloring},
	booktitle = {39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings},
	year = {1998},
	month = {1998/11/08/11},
	pages = {684 - 693},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We show that for all large n, every n-uniform hypergraph with at most 0.7√(n/lnn){\texttimes}2n edges can be two-colored. We, in fact, present fast algorithms that output a proper two-coloring with high probability for such hypergraphs. We also derandomize and parallelize these algorithms, to derive NC1 versions of these results. This makes progress on a problem of Erdos (1963), improving the previous-best bound of n1/3-0(1){\texttimes}2n due to Beck (1978). We further generalize this to a {\textquotedblleft}local{\textquotedblright} version, improving on one of the first applications of the Lovasz Local Lemma},
	keywords = {algorithms, Application software, Approximation algorithms, bounds, computational geometry, Computer science, Contracts, Erbium, graph colouring, History, hypergraph two-coloring, Lab-on-a-chip, MATHEMATICS, n-uniform hypergraph, Parallel algorithms, Polynomials, probability},
	isbn = {0-8186-9172-7},
	doi = {10.1109/SFCS.1998.743519},
	author = {Radhakrishnan,J. and Srinivasan, Aravind}
}
@conference {17627,
	title = {Multicommodity flow and circuit switching},
	booktitle = {, Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998},
	volume = {7},
	year = {1998},
	month = {1998/01/06/9},
	pages = {459-465 vol.7 - 459-465 vol.7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Given a set of request pairs in a network, the problem of routing virtual circuits with low congestion is to connect each pair by a path so that few paths use the same link in the network. We build on an earlier multicommodity flow based approach of Leighton and Rao (1996) to show that short flow paths lead to path selections with low congestion. This shows that such good path selections exist for constant-degree expanders with strong expansion, generalizing a result of (Broder et al., 1994). We also show, for infinitely many n, n-vertex undirected graphs Gn along with a set T of connection requests, such that: T is fractionally realizable using flow-paths that impose a (fractional) congestion of at most 1; but any rounding of such a flow to the given set of flow-paths, leads to a congestion of Ω(log n/log log n). This is progress on a long-standing open problem},
	keywords = {Application software, Bandwidth, circuit switching, Computer science, constant-degree expanders, graph theory, High speed integrated circuits, Integrated circuit technology, Laboratories, low congestion, MATHEMATICS, multicommodity flow, National electric code, network routing, path selections, Routing, short flow paths, Switching circuits, switching theory, undirected graphs, virtual circuit routing},
	isbn = {0-8186-8255-8},
	doi = {10.1109/HICSS.1998.649241},
	author = {Leighton,T. and Rao,S. and Srinivasan, Aravind}
}
@conference {14621,
	title = {Hardness of flip-cut problems from optical mapping [DNA molecules application]},
	booktitle = {Compression and Complexity of Sequences 1997. Proceedings},
	year = {1997},
	month = {1997/06/11/13},
	pages = {275 - 284},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Optical mapping is a new technology for constructing restriction maps. Associated computational problems include aligning multiple partial restriction maps into a single {\textquotedblleft}consensus{\textquotedblright} restriction map, and determining the correct orientation of each molecule, which was formalized as the exclusive binary flip cut (EBFC) problem by Muthukrishnan and Parida (see Proc. of the First ACM Conference on Computational Molecular Biology (RECOMB), Santa Fe, p.209-19, 1997). Here, the authors prove that the EBFC problem, as well as a number of its variants, are NP-complete. They also identify another problem formalized as binary shift cut (BSC) problem motivated by the fact that there might be missing fragments at the beginnings and/or the ends of the molecules, and prove it to be NP-complete. Therefore, they do not have efficient, that is, polynomial time solutions unless P=NP},
	keywords = {binary shift cut, Biochemistry, Bioinformatics, biological techniques, Biology, biomedical optical imaging, combinatorial mathematics, combinatorial problem, computational complexity, computational problems, DNA, DNA molecule, exclusive binary flip cut, flip-cut problem hardness, Genetic engineering, Genomics, MATHEMATICS, molecular biology, molecular biophysics, molecule orientation, multiple partial restriction maps, NP-complete problem, optical mapping, polynomial time solutions, Polynomials, sequences},
	isbn = {0-8186-8132-2},
	doi = {10.1109/SEQUEN.1997.666922},
	author = {Dancik,V. and Hannenhalli, Sridhar and Muthukrishnan,S.}
}
@conference {17660,
	title = {Splitters and near-optimal derandomization},
	booktitle = {, 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings},
	year = {1995},
	month = {1995/10/23/25},
	pages = {182 - 191},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n,k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2k configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal ΣIIΣ threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits},
	keywords = {Boosting, Circuit testing, computational complexity, computational linguistics, Computer science, Contracts, derandomization, deterministic constructions, Educational institutions, Engineering profession, exhaustive testing, fairly general method, fixed-subgraph finding algorithms, hardness of approximation, Information systems, k-restrictions, learning, local-coloring protocol, MATHEMATICS, near-optimal constructions, near-optimal derandomization, Parallel algorithms, probabilistic bound, probability, Protocols, randomised algorithms, Set cover, splitters},
	isbn = {0-8186-7183-1},
	doi = {10.1109/SFCS.1995.492475},
	author = {Naor,M. and Schulman,L. J and Srinivasan, Aravind}
}
@conference {17577,
	title = {Computing with very weak random sources},
	booktitle = {, 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings},
	year = {1994},
	month = {1994/11/20/22},
	pages = {264 - 275},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {For any fixed ε>0, we show how to simulate RP algorithms in time nO(log n) using the output of a δ-source with min-entropy R(ε). Such a weak random source is asked once for R(ε) bits; it outputs an R-bit string such that any string has probability at most 2-R(ε). If ε>1-1/(k+1), our BPP simulations take time nO(log(k n)) (log(k) is the logarithm iterated k times). We also give a polynomial-time BPP simulation using Chor-Goldreich sources of min-entropy RΩ(1), which is optimal. We present applications to time-space tradeoffs, expander constructions, and the hardness of approximation. Also of interest is our randomness-efficient Leftover Hash Lemma, found independently by Goldreich and Wigderson},
	keywords = {Application software, BPP simulations, Chor-Goldreich sources, computational complexity, Computational modeling, Computer science, Computer simulation, cryptography, distributed algorithms, expander constructions, hardness, MATHEMATICS, min-entropy, Physics computing, Polynomials, probability, R-bit string, randomness-efficient Leftover Hash Lemma, RP algorithms simulation, Testing, time-space tradeoffs, very weak random sources},
	isbn = {0-8186-6580-7},
	doi = {10.1109/SFCS.1994.365688},
	author = {Srinivasan, Aravind and Zuckerman,D.}
}
@article {12051,
	title = {Computing Intrinsic Images.},
	year = {1986},
	month = {1986/08//},
	abstract = {Low level modern computer vision is not domain dependent, but concentrates on problems that correspond to identifiable modules in the human visual system. Several theories have been proposed in the literature for the computation of shape from shading, shape from texture, retinal motion from spatiotemporal derivatives of the image intensity function and the like. The problems with the existing approach are basically the following: (1) The employed assumptions are very strong and so most of the algorithms fail when applied to real images. (2) Usually the constraints from the geometry and the physics of the problem are not enough to guarantee uniqueness of the computed parameters. (3) In most cases the resulting algorithms are not robust, in the sense that if there is a slight error in the input this results in a catastrophic error in the output. In this thesis the problem of machine vision is explored from its basics. A low level mathematical theory is presented for the unique robust computation of intrinsic parameters. The computational aspect of the theory envisages a cooperative highly parallel implementation, bringing in information from five different sources (shading, texture, motion, contour and stereo), to resolve ambiguities and ensure uniqueness and stability of the intrinsic parameters. The problems of shape from texture, shape from shading and motion, visual motion analysis and shape and motion from contour are analyzed in detail.},
	keywords = {*ARTIFICIAL INTELLIGENCE, *COMPUTERS, *IMAGE PROCESSING, *VISION, algorithms, CAMERAS, CATASTROPHIC CONDITIONS, COMPUTATIONS, CYBERNETICS, ERRORS, HUMANS, IMAGES, INTENSITY, LOW LEVEL, MATHEMATICS, MOTION, RETINA, Robots, SHADOWS, SHAPE, TEXTURE, THEORY, THESES.},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA189440},
	author = {Aloimonos, J.}
}
