2774 search results - page 282 / 555 » Exploiting Deep Structure |
200
click to vote
SGAI
2004
Springer
16 years 11 hour ago
2004
Springer
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
156
click to vote
SSPR
2004
Springer
16 years 10 hour ago
2004
Springer
Most machine learning algorithms are designed either for supervised or for unsupervised learning, notably classification and clustering. Practical problems in bioinformatics and i...
173
click to vote
TYPES
2004
Springer
16 years 9 hour ago
2004
Springer
Abstract. The prototype of a content based search engine for mathematical knowledge supporting a small set of queries requiring matching and/or typing operations is described. The ...
178
click to vote
DATE
2003
IEEE
15 years 12 months ago
2003
IEEE
Novel reconfigurable computing architectures exploit the inherent parallelism available in many signalprocessing problems. These architectures often consist of networks of compute...
184
click to vote
ICCV
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper describes an approach to recovering surface models of complex scenes from the quasi-sparse data returned by a feature based stereo system. The method can be used to mer...