Sciweavers

231 search results - page 30 / 47
» Two lower bounds for self-assemblies at temperature 1
Sort
View
IPL
2006
141views more  IPL 2006»
14 years 9 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
FCT
2005
Springer
15 years 3 months ago
Almost Optimal Explicit Selectors
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
Bogdan S. Chlebus, Dariusz R. Kowalski
139
Voted
PODS
2009
ACM
110views Database» more  PODS 2009»
15 years 10 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
LICS
2005
IEEE
15 years 3 months ago
Inverse and Implicit Functions in Domain Theory
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
Abbas Edalat, Dirk Pattinson
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
14 years 9 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo