2609 search results - page 105 / 522 » Optimizing for parallelism and data locality |
119
click to vote
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
VLDB
1998
ACM
15 years 4 months ago
1998
ACM
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
96
Voted
CCGRID
2008
IEEE
15 years 7 months ago
2008
IEEE
Distributed applications tend to have a complex design due to issues such as concurrency, synchronization and communication. Researchers in the past have proposed abstractions to ...
93
Voted
ML
2010
ACM
14 years 11 months ago
2010
ACM
When only a small number of labeled samples are available, supervised dimensionality reduction methods tend to perform poorly due to overfitting. In such cases, unlabeled samples ...
NIPS
2004
15 years 2 months ago
2004
We describe an algorithm for support vector machines (SVM) that can be parallelized efficiently and scales to very large problems with hundreds of thousands of training vectors. I...