896 search results - page 80 / 180 » On completeness of word reversing |
79
Voted
SIAMMAX
2010
14 years 7 months ago
2010
We investigate the structural, spectral, and sparsity properties of Stochastic Galerkin matrices as they arise in the discretization of linear differential equations with random co...
119
Voted
ACL
2012
13 years 3 months ago
2012
“Lightweight” semantic annotation of text calls for a simple representation, ideally without requiring a semantic lexicon to achieve good coverage in the language and domain. ...
106
click to vote
ENTCS
2007
15 years 23 days ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
92
Voted
TSD
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Dental rehabilitation by complete dentures is a state-of-the-art approach to improve functional aspects of the oral cavity of edentulous patients. It is important to assu...
83
Voted
IDEAL
2009
Springer
14 years 10 months ago
2009
Springer
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...