Sciweavers

231 search results - page 8 / 47
» Two lower bounds for self-assemblies at temperature 1
Sort
View
CORR
2011
Springer
203views Education» more  CORR 2011»
14 years 4 months ago
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse s...
Laurent Jacques, Jason N. Laska, Petros Boufounos,...
COCOON
2005
Springer
15 years 3 months ago
Finding Longest Increasing and Common Subsequences in Streaming Data
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
David Liben-Nowell, Erik Vee, An Zhu
OPODIS
2008
14 years 11 months ago
On the Time-Complexity of Robust and Amnesic Storage
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
Dan Dobre, Matthias Majuntke, Neeraj Suri
COMPGEOM
2008
ACM
14 years 11 months ago
Extremal problems on triangle areas in two and three dimensions
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
Adrian Dumitrescu, Micha Sharir, Csaba D. Tó...
COMPGEOM
1996
ACM
15 years 1 months ago
Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version)
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...
Marek Chrobak, Michael T. Goodrich, Roberto Tamass...