231 search results - page 36 / 47 » Two lower bounds for self-assemblies at temperature 1 |
STOC
2004
ACM
15 years 9 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
164
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
72
Voted
GLOBECOM
2008
IEEE
15 years 3 months ago
2008
IEEE
— We consider beamforming in a cognitive network with multiple primary users and secondary users sharing the same spectrum. In particular, we assume that each secondary transmitt...
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...