Sciweavers

1430 search results - page 115 / 286
» Representing Probability Measures using Probabilistic Proces...
Sort
View
FLAIRS
2008
13 years 11 months ago
Learning a Probabilistic Model of Event Sequences from Internet Weblog Stories
One of the central problems in building broad-coverage story understanding systems is generating expectations about event sequences, i.e. predicting what happens next given some a...
Mehdi Manshadi, Reid Swanson, Andrew S. Gordon
ICASSP
2011
IEEE
13 years 27 days ago
A new criterion for optimal constrained minimax detection and classification
This paper adresses the problem of anomaly detection and classification by using a noisy measurement vector corrupted by some linear unknown nuisance parameters. An invariant con...
Lionel Fillatre, Igor Nikiforov
PRL
2007
108views more  PRL 2007»
13 years 8 months ago
Towards a measure of deformability of shape sequences
In this paper we develop a theory for characterizing how deformable a shape is given a sequence of its observations. We define a term called ‘‘deformability index’’ (DI) ...
Amit K. Roy Chowdhury
JCT
2000
111views more  JCT 2000»
13 years 9 months ago
Immanants and Finite Point Processes
Givena Hermitian,non-negativede nitekernelK and a character of the symmetric group on n letters, de ne the corresponding immanant function K x1;::: ;xn := P Qn i=1 Kxi;x i, where ...
Persi Diaconis, Steven N. Evans
SIGOPSE
2004
ACM
14 years 2 months ago
An approach to benchmarking configuration complexity
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
Aaron B. Brown, Joseph L. Hellerstein