Sciweavers

5595 search results - page 298 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ANOR
2004
116views more  ANOR 2004»
15 years 6 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
ISMIS
2005
Springer
16 years 5 days ago
Incremental Collaborative Filtering for Highly-Scalable Recommendation Algorithms
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
Manos Papagelis, Ioannis Rousidis, Dimitris Plexou...
CSDA
2006
82views more  CSDA 2006»
15 years 6 months ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin
ICIP
2001
IEEE
16 years 8 months ago
Improving a genetic algorithm segmentation by means of a fast edge detection technique
Thispaper presents a new hybrid range image segmentation approach. Two separate techniques are applied consecutively. First, iin edge based segmentation technique extracts the edg...
Angel Domingo Sappa, Vitoantonio Bevilacqua, Miche...
MLDM
1999
Springer
15 years 11 months ago
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
Irwin King, Tak-Kan Lau