Sciweavers

371 search results - page 46 / 75
» An anytime algorithm for optimal coalition structure generat...
Sort
View
MOR
2010
120views more  MOR 2010»
13 years 6 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...
AIRS
2006
Springer
13 years 11 months ago
A Novel Ant-Based Clustering Approach for Document Clustering
Recently, much research has been proposed using nature inspired algorithms to perform complex machine learning tasks. Ant Colony Optimization (ACO) is one such algorithm based on s...
Yulan He, Siu Cheung Hui, Yongxiang Sim
STRINGOLOGY
2004
13 years 9 months ago
Sorting suffixes of two-pattern strings
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
Frantisek Franek, William F. Smyth
DAC
2001
ACM
14 years 8 months ago
Dynamic Detection and Removal of Inactive Clauses in SAT with Application in Image Computation
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...
Aarti Gupta, Anubhav Gupta, Zijiang Yang, Pranav A...
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount