Search Sciweavers | Sciweavers

17541 search results - page 50 / 3509

» Complexity in scalable computing

132

Voted

JC
2007

130views more JC 2007»

On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety

15 years 3 months ago

Download math-www.uni-paderborn.de

We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we ﬁrst prove that the problem of deciding ...

Peter Scheiblechner

claim paper

Read More »

175

click to vote

STOC
2012
ACM

221views Algorithms» more STOC 2012»

From query complexity to computational complexity

13 years 5 months ago

Download theory.stanford.edu

We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...

Shahar Dobzinski, Jan Vondrák

claim paper

Read More »

188

Voted

VLDB
2005
ACM

132views Database» more VLDB 2005»

Hash-based labeling techniques for storage scaling

16 years 3 months ago

Download infolab.usc.edu

Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...

Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson

claim paper

Read More »

123

click to vote

FOCM
2007

76views more FOCM 2007»

The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties

15 years 3 months ago

Download math-www.uni-paderborn.de

Peter Bürgisser, Martin Lotz

claim paper