Sciweavers

7015 search results - page 94 / 1403

» Approximation algorithms for co-clustering

25

WABI
2005
Springer

91views Bioinformatics» more WABI 2005»

A 1.375-Approximation Algorithm for Sorting by Transpositions

14 years 2 months ago

A 1.375-Approximation Algorithm for Sorting by Transpositions

Download www.nada.kth.se

Isaac Elias, Tzvika Hartman

claim paper

Read More »

31

WAOA
2005
Springer

127views Algorithms» more WAOA 2005»

Improved Approximation Algorithm for Convex Recoloring of Trees

14 years 2 months ago

Improved Approximation Algorithm for Convex Recoloring of Trees

Download www.cs.technion.ac.il

Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz

claim paper

Read More »

17

ESA
2004
Springer

87views Algorithms» more ESA 2004»

A Fast Distributed Algorithm for Approximating the Maximum Matching

14 years 2 months ago

A Fast Distributed Algorithm for Approximating the Maximum Matching

Download math.la.asu.edu

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...

claim paper

Read More »

23

WABI
2004
Springer

112views Bioinformatics» more WABI 2004»

A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals

14 years 2 months ago

A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals

Download www.cs.tau.ac.il

Tzvika Hartman, Roded Sharan

claim paper

Read More »

26

STOC
1998
ACM

111views Algorithms» more STOC 1998»

A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents

14 years 1 months ago

A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents

Download www.math.ias.edu

We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...

Nathan Linial, Alex Samorodnitsky, Avi Wigderson

claim paper

Read More »

« Prev « First page 94 / 1403 Last » Next »