Sciweavers

74 search results - page 8 / 15
» ccr 2007
Sort
View
APAL
2006
64views more  APAL 2006»
13 years 8 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký
ECCC
2007
127views more  ECCC 2007»
13 years 8 months ago
Universal Semantic Communication I
Is it possible for two intelligent beings to communicate meaningfully, without any common language or background? This question has interest on its own, but is especially relevant...
Brendan Juba, Madhu Sudan
CCR
2007
110views more  CCR 2007»
13 years 8 months ago
Future internet research and experimentation: the FIRE initiative
The research community worldwide has increasingly drawn its attention to the weaknesses of the current Internet. Many proposals are addressing the perceived problems, ranging from...
Anastasius Gavras, Arto Karila, Serge Fdida, Marti...
CCR
2007
107views more  CCR 2007»
13 years 8 months ago
Dynamic load balancing without packet reordering
Dynamic load balancing is a popular recent technique that protects ISP networks from sudden congestion caused by load spikes or link failures. Dynamic load balancing protocols, ho...
Srikanth Kandula, Dina Katabi, Shantanu Sinha, Art...
CCR
2007
86views more  CCR 2007»
13 years 8 months ago
An addressing independent networking structure favorable for all-optical packet switching
All-optical packet switching (AOPS) technology is essential to fully utilize the tremendous bandwidth provided by advanced optical communication techniques through forwarding pack...
Shengming Jiang