Sciweavers

836 search results - page 47 / 168
» On the Complexity of Train Assignment Problems
Sort
View
AAAI
2010
15 years 5 months ago
A Bayesian Nonparametric Approach to Modeling Mobility Patterns
Constructing models of mobile agents can be difficult without domain-specific knowledge. Parametric models flexible enough to capture all mobility patterns that an expert believes...
Joshua Mason Joseph, Finale Doshi-Velez, Nicholas ...
136
Voted
ICMCS
2008
IEEE
151views Multimedia» more  ICMCS 2008»
15 years 10 months ago
Fast keyword detection with sparse time-frequency models
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
Effrosini Kokiopoulou, Pascal Frossard, Olivier Ve...
ENTCS
2006
113views more  ENTCS 2006»
15 years 3 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
GLOBECOM
2006
IEEE
15 years 10 months ago
Two Novel Iterative Joint Frequency-Offset and Channel Estimation Methods for OFDMA Uplink
—We address joint estimation of frequency offsets and channel responses in OFDMA uplink. A cyclically equal-spaced, equal-energy interleaved pilot preamble is proposed by which t...
Xiaoyu Fu, Hlaing Minn, Cyrus D. Cantrell
CVIU
2007
193views more  CVIU 2007»
15 years 3 months ago
Interpretation of complex scenes using dynamic tree-structure Bayesian networks
This paper addresses the problem of object detection and recognition in complex scenes, where objects are partially occluded. The approach presented herein is based on the hypothe...
Sinisa Todorovic, Michael C. Nechyba