Sciweavers

5595 search results - page 484 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
MOC
2000
124views more  MOC 2000»
15 years 7 months ago
Local and parallel finite element algorithms based on two-grid discretizations
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
Jinchao Xu, Aihui Zhou
TEC
2010
126views more  TEC 2010»
15 years 2 months ago
Learning the Large-Scale Structure of the MAX-SAT Landscape Using Populations
A new algorithm for solving MAX-SAT problems is introduced which clusters good solutions, and restarts the search from the closest feasible solution to the centroid of each cluster...
Mohamed Qasem, Adam Prügel-Bennett
IJRR
2007
60views more  IJRR 2007»
15 years 7 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides
KDD
2009
ACM
243views Data Mining» more  KDD 2009»
16 years 8 months ago
Exploiting Wikipedia as external knowledge for document clustering
In traditional text clustering methods, documents are represented as "bags of words" without considering the semantic information of each document. For instance, if two ...
Xiaohua Hu, Xiaodan Zhang, Caimei Lu, E. K. Park, ...

Publication
417views
16 years 4 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos