10988 search results - page 345 / 2198 » Algorithmic Folding Complexity |
149
Voted
ECML
2005
Springer
15 years 10 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
157
click to vote
CONTEXT
2003
Springer
15 years 10 months ago
2003
Springer
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
116
click to vote
SDM
2010
SIAM
15 years 6 months ago
2010
SIAM
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
129
click to vote
TAPD
1998
15 years 6 months ago
1998
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
147
click to vote
MOC
2002
15 years 4 months ago
2002
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...