@conference {13943,
	title = {A partial least squares framework for speaker recognition},
	booktitle = {Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on},
	year = {2011},
	month = {2011/05//},
	pages = {5276 - 5279},
	abstract = {Modern approaches to speaker recognition (verification) operate in a space of "supervectors" created via concatenation of the mean vectors of a Gaussian mixture model (GMM) adapted from a universal background model (UBM). In this space, a number of approaches to model inter-class separability and nuisance attribute variability have been proposed. We develop a method for modeling the variability associated with each class (speaker) by using partial-least-squares - a latent variable modeling technique, which isolates the most informative subspace for each speaker. The method is tested on NIST SRE 2008 data and provides promising results. The method is shown to be noise-robust and to be able to efficiently learn the subspace corresponding to a speaker on training data consisting of multiple utterances.},
	keywords = {approximations;speaker, attribute, background, GMM;Gaussian, least, mixture, model;Gaussian, model;NIST, modeling, processes;least, recognition;, recognition;speaker, separability;latent, squares, squares;partial-least-squares;speaker, SRE;interclass, technique;multiple, utterances;nuisance, variability;partial, variable, verification;universal},
	doi = {10.1109/ICASSP.2011.5947548},
	author = {Srinivasan,B.V. and Zotkin,Dmitry N and Duraiswami, Ramani}
}
@conference {12610,
	title = {Recognition of Multi-Object Events Using Attribute Grammars},
	booktitle = {Image Processing, 2006 IEEE International Conference on},
	year = {2006},
	month = {2006/10//},
	pages = {2897 - 2900},
	abstract = {We present a method for representing and recognizing visual events using attribute grammars. In contrast to conventional grammars, attribute grammars are capable of describing features that are not easily represented by finite symbols. Our approach handles multiple concurrent events involving multiple entities by associating unique object identification labels with multiple event threads. Probabilistic parsing and probabilistic conditions on the attributes are used to achieve a robust recognition system. We demonstrate the effectiveness of our method for the task of recognizing vehicle casing in parking lots and events occurring in an airport tarmac},
	keywords = {attribute, event, grammar;multiobject, grammars;image, identification, label;probabilistic, parsing;attribute, recognition;object, recognition;probability;, representation;object},
	doi = {10.1109/ICIP.2006.313035},
	author = {Joo,Seong-Wook and Chellapa, Rama}
}
@conference {13616,
	title = {On musical score recognition using probabilistic reasoning},
	booktitle = {Document Analysis and Recognition, 1999. ICDAR {\textquoteright}99. Proceedings of the Fifth International Conference on},
	year = {1999},
	month = {1999/09//},
	pages = {115 - 118},
	abstract = {We present a probabilistic framework for document analysis and recognition and illustrate it on the problem of musical score recognition. Our system uses an explicit descriptive model of the document class to find the most likely interpretation of a scanned document image. In contrast to the traditional pipeline architecture, we carry out all stages of the analysis with a single inference engine, allowing for an end-to-end propagation of the uncertainty. The global modeling structure is similar to a stochastic attribute grammar, and local parameters are estimated using hidden Markov models},
	keywords = {analysis;document, attribute, class;document, descriptive, document, engine;local, estimation;musical, grammar;attribute, grammars;character, handling;, image, interpretation;stochastic, Markov, mechanisms;music;uncertainty, model;global, modeling, models;inference, parameter, processing;image, propagation;explicit, reasoning;scanned, recognition;document, recognition;end-to-end, recognition;inference, recognition;probabilistic, score, structure;hidden, Uncertainty},
	doi = {10.1109/ICDAR.1999.791738},
	author = {Stuckelberg,M.V. and David Doermann}
}
@conference {16167,
	title = {Refining query previews techniques for data with multivalued attributes: the case of NASA EOSDIS},
	booktitle = {Research and Technology Advances in Digital Libraries, 1999. ADL {\textquoteright}99. Proceedings. IEEE Forum on},
	year = {1999},
	month = {1999///},
	pages = {50 - 59},
	abstract = {Query Previews allow users to rapidly gain an understanding of the content and scope of a digital data collection. These previews present overviews of abstracted metadata, enabling users to rapidly and dynamically avoid undesired data. We present our recent work on developing query previews for a variety of NASA EOSDIS situations. We focus on approaches that successfully address the challenge of multi-valued attribute data. Memory requirements and processing time associated with running these new solutions remain independent of the number of records in the dataset. We describe two techniques and their respective prototypes used to preview NASA Earth science data},
	keywords = {attribute, attributes;processing, collection;memory, computing;meta, data, data;abstracted, data;digital, data;multivalued, data;query, Earth, EOSDIS;NASA, libraries;geophysics, metadata;dataset;digital, NASA, previews, processing;, requirements;multi-valued, Science, techniques;undesired, time;query},
	doi = {10.1109/ADL.1999.777690},
	author = {Plaisant, Catherine and Venkatraman,M. and Ngamkajorwiwat,K. and Barth,R. and Harberts,B. and Feng,Wenlan}
}
@article {18391,
	title = {Experimental models for validating technology},
	journal = {Computer},
	volume = {31},
	year = {1998},
	month = {1998/05//},
	pages = {23 - 31},
	abstract = {Experimentation helps determine the effectiveness of proposed theories and methods. However, computer science has not developed a concise taxonomy of methods for demonstrating the validity of new techniques. Experimentation is a crucial part of attribute evaluation and can help determine whether methods used in accordance with some theory during product development will result in software being as effective as necessary. By looking at multiple examples of technology validation, the authors develop a taxonomy for software engineering experimentation that describes twelve different experimental approaches},
	keywords = {attribute, development;software, engineering, engineering;, evaluation;computer, experimentation;technology, models;product, science;experimental, validation;product},
	isbn = {0018-9162},
	doi = {10.1109/2.675630},
	author = {Zelkowitz, Marvin V and Wallace,D. R}
}
@conference {16201,
	title = {Query previews in networked information systems},
	booktitle = {Research and Technology Advances in Digital Libraries, 1996. ADL {\textquoteright}96., Proceedings of the Third Forum on},
	year = {1996},
	month = {1996/05//},
	pages = {120 - 129},
	abstract = {In a networked information system (such as the NASA Earth Observing System-Data Information System (EOS-DIS)), there are three major obstacles facing users in a querying process: network performance, data volume and data complexity. In order to overcome these obstacles, we propose a two phase approach to query formulation. The two phases are the Query Preview and the Query Refinement. In the Query Preview phase, users formulate an initial query by selecting rough attribute values. The estimated number of matching data sets is shown, graphically on preview bars which allows users to rapidly focus on a manageable number of relevant data sets. Query previews also prevent wasted steps by eliminating zero hit queries. When the estimated number of data sets is long enough, the initial query is submitted to the network which returns the metadata of the data sets for further refinement in the Query Refinement phase. The two phase approach to query formulation overcomes slow network performance, and reduces the data volume and data complexity, problems. This approach is especially appropriate for users who do not have extensive knowledge about the data and who prefer an exploratory method to discover data patterns and exceptions. Using this approach, we have developed dynamic query user interfaces to allow users to formulate their queries across a networked environment},
	keywords = {attribute, complexity;data, data, Earth, environment;networked, EOS-DIS;NASA, formulation;querying, formulation;user, hit, information, interfaces;, interfaces;exploratory, method;matching, networks;information, Observing, patterns;data, performance;networked, Preview;Query, process;rough, queries;computer, query, refinement;data, retrieval;information, services;interactive, sets;network, System-Data, System;Query, systems;query, user, values;zero, volume;dynamic},
	doi = {10.1109/ADL.1996.502522},
	author = {Donn,K. and Plaisant, Catherine and Shneiderman, Ben}
}
