Sciweavers

33

FOCS
1998
IEEE

90views Theoretical Computer Science» more FOCS 1998»

Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations

14 years 3 months ago

Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations

Download www-math.mit.edu

Alan M. Frieze, Ravi Kannan, Santosh Vempala

claim paper

Read More »

40

FOCS
1998
IEEE

75views Theoretical Computer Science» more FOCS 1998»

On the Single-Source Unsplittable Flow Problem

14 years 3 months ago

On the Single-Source Unsplittable Flow Problem

Download www.cse.iitd.ernet.in

Yefim Dinitz, Naveen Garg, Michel X. Goemans

claim paper

Read More »

25

FOCS
1998
IEEE

83views Theoretical Computer Science» more FOCS 1998»

Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model

14 years 3 months ago

Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model

Download www.csc.liv.ac.uk

Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg

claim paper

Read More »

28

FOCS
1998
IEEE

72views Theoretical Computer Science» more FOCS 1998»

The Finite Capacity Dial-A-Ride Problem

14 years 3 months ago

The Finite Capacity Dial-A-Ride Problem

Download www2.imm.dtu.dk

In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...

Moses Charikar, Balaji Raghavachari

claim paper

Read More »

20

FOCS
1998
IEEE

72views Theoretical Computer Science» more FOCS 1998»

Approximating a Finite Metric by a Small Number of Tree Metrics

14 years 3 months ago

Approximating a Finite Metric by a Small Number of Tree Metrics

Download www.cis.upenn.edu

Moses Charikar, Chandra Chekuri, Ashish Goel, Sudi...

claim paper

Read More »

35

FOCS
1998
IEEE

112views Theoretical Computer Science» more FOCS 1998»

Towards an Optimal Bit-Reversal Permutation Program

14 years 3 months ago

Towards an Optimal Bit-Reversal Permutation Program

Download www.cs.technion.ac.il

The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...

Larry Carter, Kang Su Gatlin

claim paper

Read More »

16

FOCS
1998
IEEE

78views Theoretical Computer Science» more FOCS 1998»

Pattern Matching for Spatial Point Sets

14 years 3 months ago

Pattern Matching for Spatial Point Sets

Download www.cs.caltech.edu

David E. Cardoze, Leonard J. Schulman

claim paper

Read More »

11

FOCS
1998
IEEE

74views Theoretical Computer Science» more FOCS 1998»

Oblivious Transfer with a Memory-Bounded Receiver

14 years 3 months ago

Oblivious Transfer with a Memory-Bounded Receiver

Download crypto.cs.mcgill.ca

Christian Cachin, Claude Crépeau, Julien Ma...

claim paper

Read More »

15

FOCS
1998
IEEE

74views Theoretical Computer Science» more FOCS 1998»

Information Retrieval on the Web

14 years 3 months ago

Information Retrieval on the Web

Download www.ischool.utexas.edu

Andrei Z. Broder, Monika Rauch Henzinger

claim paper

Read More »

30

FOCS
1998
IEEE

104views Theoretical Computer Science» more FOCS 1998»

A Primitive Recursive Algorithm for the General Petri Net Reachability Problem

14 years 3 months ago

A Primitive Recursive Algorithm for the General Petri Net Reachability Problem

Download hal.archives-ouvertes.fr

Zakaria Bouziane

claim paper

Read More »