459 search results - page 63 / 92 » Computational Complexity of Probabilistic Disambiguation |
127
click to vote
APVIS
2010
15 years 1 months ago
2010
Understanding fluid flow is a difficult problem and of increasing importance as computational fluid dynamics produces an abundance of simulation data. Experimental flow analysis h...
104
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
SFM
2007
Springer
15 years 5 months ago
2007
Springer
Stochastic performance models provide a powerful way of capturing and analysing the behaviour of complex concurrent systems. Traditionally, performance measures for these models ar...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
CVIU
2007
14 years 11 months ago
2007
Multi-view face detection plays an important role in many applications. This paper presents a statistical learning method to extract features and construct classifiers for multi-...