Sciweavers

1356 search results - page 132 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
IJCAI
1989
13 years 10 months ago
An Experimental Comparison of Symbolic and Connectionist Learning Algorithms
Despite the fact that many symbolic and connectionist (neural net) learning algorithms are addressing the same problem of learning from classified examples, very little Is known r...
Raymond J. Mooney, Jude W. Shavlik, Geoffrey G. To...
FUIN
2006
139views more  FUIN 2006»
13 years 9 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
14 years 6 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
CEC
2007
IEEE
14 years 3 months ago
The differential ant-stigmergy algorithm: an experimental evaluation and a real-world application
— This paper describes the so-called Differential Ant-Stigmergy Algorithm (DASA), which is an extension of the Ant-Colony Optimization for a continuous domain. An experimental ev...
Peter Korosec, Jurij Silc, Klemen Oblak, Franc Kos...
ICIAP
2007
ACM
14 years 3 months ago
Multi-modal non-rigid registration of medical images based on mutual information maximization
In this paper, a new multi-modal non-rigid registration technique for medical images is presented. Firstly, the registration problem is outlined and some of the most common approa...
Edoardo Ardizzone, Orazio Gambino, Marco La Cascia...