Sciweavers

7648 search results - page 960 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
IJKESDP
2010
149views more  IJKESDP 2010»
15 years 5 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
CORR
2011
Springer
179views Education» more  CORR 2011»
15 years 1 months ago
Cooperative searching for stochastic targets
Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution fo...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
JMLR
2010
151views more  JMLR 2010»
15 years 1 months ago
The Feature Selection Path in Kernel Methods
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
Fuxin Li, Cristian Sminchisescu
ICASSP
2011
IEEE
14 years 10 months ago
Distributed linear discriminant analysis
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...
Sergio Valcarcel Macua, Pavle Belanovic, Santiago ...
198
Voted
ICDE
2007
IEEE
131views Database» more  ICDE 2007»
16 years 29 days ago
Incremental Clustering of Mobile Objects
Moving objects are becoming increasingly attractive to the data mining community due to continuous advances in technologies like GPS, mobile computers, and wireless communication ...
Sigal Elnekave, Mark Last, Oded Maimon