Sciweavers

12 search results - page 1 / 3
» Consensus Optimizing Both Distance Sum and Radius
Sort
View
SPIRE
2009
Springer
13 years 11 months ago
Consensus Optimizing Both Distance Sum and Radius
The consensus string problem is finding a representative string (consensus) of a given set S of strings. In this paper we deal with the consensus string problems optimizing both d...
Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin...
AAIM
2008
Springer
110views Algorithms» more  AAIM 2008»
13 years 11 months ago
Fixed-Parameter Algorithms for Kemeny Scores
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf...
PSIVT
2007
Springer
203views Multimedia» more  PSIVT 2007»
13 years 11 months ago
Direct Ellipse Fitting and Measuring Based on Shape Boundaries
: Measuring ellipticity is an important area of computer vision systems. Most existing ellipticity measures are area based and cannot be easily applied to point sets such as extrac...
Milos Stojmenovic, Amiya Nayak
BMCBI
2010
106views more  BMCBI 2010»
13 years 5 months ago
Multiple structure alignment and consensus identification for proteins
Background: An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructu...
Ivaylo Ilinkin, Jieping Ye, Ravi Janardan
STACS
2007
Springer
13 years 11 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler