Sciweavers

792 search results - page 10 / 159
» Constrained Ramsey Numbers
Sort
View
CPC
2008
112views more  CPC 2008»
13 years 7 months ago
When is an Almost Monochromatic K4 Guaranteed?
Suppose that n > (log k)ck , where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges rece...
Alexandr V. Kostochka, Dhruv Mubayi
INFOCOM
2012
IEEE
12 years 5 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
TIT
2008
105views more  TIT 2008»
13 years 7 months ago
Network Coding Capacity With a Constrained Number of Coding Nodes
Abstract-- We study network coding capacity under a constraint on the total number of network nodes that can perform coding. That is, only a certain number of network nodes can pro...
Jillian Cannons, Kenneth Zeger
CC
2005
Springer
106views System Software» more  CC 2005»
14 years 27 days ago
Source-Level Debugging for Multiple Languages with Modest Programming Effort
Abstract. We present techniques that enable source-level debugging for multiple languages at the cost of only modest programming effort. The key idea is to avoid letting debugging ...
Sukyoung Ryu, Norman Ramsey
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 7 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao