Sciweavers

3818 search results - page 214 / 764
» Word Problems on Compressed Words
Sort
View
LATIN
2004
Springer
15 years 12 months ago
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively com...
Volker Diekert, Paul Gastin
EWCBR
2008
Springer
15 years 8 months ago
iReMedI- Intelligent Retrieval from Medical Information
Abstract. Effective encoding of information is one of the keys to qualitative problem solving. Our aim is to explore Knowledge representation techniques that capture meaningful wor...
Saurav Sahay, Bharat Ravisekar, Sundaresan Venkata...
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
15 years 6 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson
ICANN
2009
Springer
16 years 1 months ago
Modelling Image Complexity by Independent Component Analysis, with Application to Content-Based Image Retrieval
Abstract. Estimating the degree of similarity between images is a challenging task as the similarity always depends on the context. Because of this context dependency, it seems qui...
Jukka Perkiö, Aapo Hyvärinen
ICASSP
2008
IEEE
16 years 29 days ago
Brute-forcing hierarchical functionals for paralinguistics: A waste of feature space?
While the ”‘quasi-state-of-the-art”’ towards acoustic emotion recognition relies on multivariate time-series analysis of e.g. pitch, energy, or MFCC by statistical functio...
Björn Schuller, Matthias Wimmer, Lorenz Moese...