Sciweavers

5595 search results - page 173 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
144
Voted
BMCBI
2004
96views more  BMCBI 2004»
15 years 5 months ago
A hybrid clustering approach to recognition of protein families in 114 microbial genomes
Background: Grouping proteins into sequence-based clusters is a fundamental step in many bioinformatic analyses (e.g., homology-based prediction of structure or function). Standar...
Timothy J. Harlow, J. Peter Gogarten, Mark A. Raga...
130
Voted
APPROX
2004
Springer
165views Algorithms» more  APPROX 2004»
15 years 10 months ago
Approximating Additive Distortion of Embeddings into Line Metrics
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
Kedar Dhamdhere
175
Voted
AI
2011
Springer
15 years 3 days ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
163
Voted
DCOSS
2006
Springer
15 years 8 months ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei
CGF
1999
79views more  CGF 1999»
15 years 4 months ago
A Practical Analysis of Clustering Strategies for Hierarchical Radiosity
The calculation of radiant energy balance in complex scenes has been made possible by hierarchical radiosity methods based on clustering mechanisms. Although clustering offers an ...
Jean-Marc Hasenfratz, Cyrille Damez, Franço...