2403 search results - page 393 / 481 » Optimal Randomized RANSAC |
112
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
112
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
151
click to vote
VLDB
2004
ACM
15 years 8 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
112
click to vote
BIBE
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
111
click to vote
CCGRID
2003
IEEE
15 years 8 months ago
2003
IEEE
Formation of suitable overlay-network topologies that are able to reflect the structure of the underlying network-infrastructure, has rarely been addressed by peer-to-peer applic...