Algorithms | Sciweavers

31

SODA
2008
ACM

86views Algorithms» more SODA 2008»

14 years 1 months ago

We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...

Michael E. Saks, C. Seshadhri

claim paper

Read More »

18

click to vote

SODA
2008
ACM

105views Algorithms» more SODA 2008»

Computing large matchings fast

14 years 1 months ago

Download www1.informatik.uni-wuerzburg.de

Ignaz Rutter, Alexander Wolff

claim paper

Read More »

43

click to vote

SODA
2008
ACM

100views Algorithms» more SODA 2008»

A tight lower bound for parity in noisy communication networks

14 years 1 months ago

Download www.tcs.tifr.res.in

We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...

Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...

claim paper

Read More »

30

click to vote

SODA
2008
ACM

71views Algorithms» more SODA 2008»

Two-phase greedy algorithms for some classes of combinatorial linear programs

14 years 1 months ago

Download grid.tsinghua.edu.cn

We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...

Ulrich Faigle, Britta Peis

claim paper

Read More »

50

click to vote

SODA
2008
ACM

75views Algorithms» more SODA 2008»

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

14 years 1 months ago

Download people.commerce.ubc.ca

Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...

S. Thomas McCormick, Satoru Fujishige

claim paper

Read More »

50

click to vote

SODA
2008
ACM

200views Algorithms» more SODA 2008»

Clustering for metric and non-metric distance measures

14 years 1 months ago

Download www.cs.uni-paderborn.de

We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...

Marcel R. Ackermann, Johannes Blömer, Christi...

claim paper

Read More »

24

click to vote

SODA
2008
ACM

105views Algorithms» more SODA 2008»

Approximation algorithms for labeling hierarchical taxonomies

14 years 1 months ago

Download www.math.uwaterloo.ca

Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy

claim paper

Read More »

44

click to vote

SODA
2008
ACM

185views Algorithms» more SODA 2008»

Better bounds for online load balancing on unrelated machines

14 years 1 months ago

Download www.ceid.upatras.gr

We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...

Ioannis Caragiannis

claim paper

Read More »

31

click to vote

SODA
2008
ACM

80views Algorithms» more SODA 2008»

Provably good multicore cache performance for divide-and-conquer algorithms

14 years 1 months ago

Download www.cs.cmu.edu

This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...

Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B....

claim paper

Read More »

31

click to vote

SODA
2008
ACM

75views Algorithms» more SODA 2008»

Approximating general metric distances between a pattern and a text

14 years 1 months ago