5595 search results - page 747 / 1119 » Approximation Algorithms for Clustering Problems |
180
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
159
click to vote
ICDCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
268
click to vote
AAAI
2010
15 years 8 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
184
click to vote
EC
2002
15 years 6 months ago
2002
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to nd a number of ...
188
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...