Sciweavers

5595 search results - page 192 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CIE
2005
Springer
15 years 8 months ago
Domain-Theoretic Formulation of Linear Boundary Value Problems
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
Dirk Pattinson
ICPR
2002
IEEE
16 years 7 months ago
A Robust Semi-Supervised EM-Based Clustering Algorithm with a Reject Option
In this paper, we address the problem of semisupervision in the framework of parametric clustering by using labeled and unlabeled data together. Clustering algorithms can take adv...
Christophe Saint-Jean, Carl Frélicot
ICDCIT
2005
Springer
15 years 11 months ago
Merging Clustering Algorithms in Mobile Ad Hoc Networks
Abstract. Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a n...
Orhan Dagdeviren, Kayhan Erciyes, Deniz Cokuslu
MOR
2006
95views more  MOR 2006»
15 years 6 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
IIS
2004
15 years 7 months ago
Lingo: Search Results Clustering Algorithm Based on Singular Value Decomposition
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search results list returned from a search engine. In this paper we present...
Stanislaw Osinski, Jerzy Stefanowski, Dawid Weiss