Sciweavers

5329 search results - page 404 / 1066
» The Weighted Majority Algorithm
Sort
View
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 12 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 11 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
BMCBI
2007
133views more  BMCBI 2007»
15 years 7 months ago
Semantic integration to identify overlapping functional modules in protein interaction networks
Background: The systematic analysis of protein-protein interactions can enable a better understanding of cellular organization, processes and functions. Functional modules can be ...
Young-Rae Cho, Woochang Hwang, Murali Ramanathan, ...
JCB
2000
101views more  JCB 2000»
15 years 6 months ago
Evaluation Measures of Multiple Sequence Alignments
Multiple sequence alignments (MSAs) are frequently used in the study of families of protein sequences or DNA/RNA sequences. They are a fundamental tool for the understanding of th...
Gaston H. Gonnet, Chantal Korostensky, Steven A. B...