5022 search results - page 248 / 1005 » Data structures and problem solving using Java |
148
click to vote
SIGMOD
2001
ACM
16 years 2 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
114
Voted
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor pre...
111
Voted
AAAI
2007
15 years 4 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
126
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
The use of 3-D ultrasound data has several advantages over 2-D ultrasound for fetal biometric measurements, such as considerable decrease in the examination time, possibility of p...
110
click to vote
ICANN
2001
Springer
15 years 7 months ago
2001
Springer
In manipulating data such as in supervised learning, we often extract new features from original features for the purpose of reducing the dimensions of feature space and achieving ...