7648 search results - page 157 / 1530 » A Data Locality Optimizing Algorithm |
136
click to vote
ESANN
2000
15 years 3 months ago
2000
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
132
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
121
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
141
Voted
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
104
Voted
NIPS
2004
15 years 3 months ago
2004
We claim and present arguments to the effect that a large class of manifold learning algorithms that are essentially local and can be framed as kernel learning algorithms will suf...